ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술지 Subspace Projection-Based Clustering and Temporal ACRs Mining on MapReduce for Direct Marketing Service
Cited 3 time in scopus Download 3 time Share share facebook twitter linkedin kakaostory
저자
이헌규, 최용훈, 정훈, 신용호
발행일
201504
출처
ETRI Journal, v.37 no.2, pp.317-327
ISSN
1225-6463
출판사
한국전자통신연구원 (ETRI)
DOI
https://dx.doi.org/10.4218/etrij.15.2314.0068
협약과제
14MC1100, SMART Post 구축 기술 개발, 정훈
초록
A reliable analysis of consumer preference from a large amount of purchase data acquired in real time and an accurate customer characterization technique are essential for successful direct marketing campaigns. In this study, an optimal segmentation of post office customers in Korea is performed using a subspace projection-based clustering method to generate an accurate customer characterization from a high-dimensional census dataset. Moreover, a traditional temporal mining method is extended to an algorithm using the MapReduce framework for a consumer preference analysis. The experimental results show that it is possible to use parallel mining through a MapReduce-based algorithm and that the execution time of the algorithm is faster than that of a traditional method.
KSP 제안 키워드
Clustering method, Consumer preferences, High-dimensional, MapReduce framework, Marketing campaigns, Marketing service, Mining method, Optimal segmentation, Parallel mining, Preference analysis, Real-Time