Mining association rules procedure to support on-line recommendation by customers and products fragmentation

被引:84
作者
Changchien, SW [1 ]
Lu, TC [1 ]
机构
[1] Chaoyang Univ Technol, Dept Informat Management, Taichung, Taiwan
关键词
data mining; SOM; rough set; association rules; on-line marketing;
D O I
10.1016/S0957-4174(01)00017-3
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Electronic Commerce (EC) has offered a new channel for instant on-line shopping. However, there are too many various products available from a great number of virtual stores on the Internet for Internet shoppers to select. On-line one-to-one marketing therefore becomes a great assistance to Internet shoppers. One of the most important marketing resources is the prior daily transaction records in the database. The great amount of data not only gives the statistics, but also offers the resource of experiences and knowledge. It is quite natural that marketing managers can perform data mining on the daily transactions and treat the shoppers the way they prefer. However, the data mining on a significant amount of transaction records requires efficient tools. Data mining from automatic or semi-automatic exploration and analysis on a large amount of data items set in a database can discover significant patterns and rules underlying the database. The knowledge can be equipped in the on-line marketing system to promote Internet sales. The purpose of this paper is to develop a mining association rules procedure from a database to support on-line recommendation. By customers and products fragmentation, product recommendation based on the hidden habits of customers in the database is therefore very meaningful. The proposed data mining procedure consists of two essential modules. One is a clustering module based on a neural network, Self-Organization Map (SOM), which performs affinity grouping tasks on a large amount of database records. The other rule is extraction module employing rough set theory that can extract association rules for each homogeneous cluster of data records and the relationships between different clusters. The implemented system was applied to a sample of sales records from a database for illustration. (C) 2001 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:325 / 335
页数:11
相关论文
共 32 条
[1]  
Agrawal R., 1993, SIGMOD Record, V22, P207, DOI 10.1145/170036.170072
[2]   A Data Mining methodology for cross-sales [J].
Anand, SS ;
Patrick, AR ;
Hughes, JG ;
Bell, DA .
KNOWLEDGE-BASED SYSTEMS, 1998, 10 (07) :449-461
[3]  
[Anonymous], P 1998 ACM SIGMOD IN
[4]   Perspectives on operations research in data and knowledge management [J].
Basu, A .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 111 (01) :1-14
[5]  
Bayardo R.J., 1999, P 5 ACM SIGKDD INT C, P145, DOI [10.1145/312129.312219, DOI 10.1145/312129.312219]
[6]  
BEERY JA, 1997, DATA MINING TECHNIQU
[7]  
Bhattacharyya S., 2000, Proceedings. KDD-2000. Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, P465, DOI 10.1145/347090.347186
[8]  
Brijs T., 2000, Proceedings. KDD-2000. Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, P300, DOI 10.1145/347090.347156
[9]   A rough set approach to attribute generalization in data mining [J].
Chan, CC .
INFORMATION SCIENCES, 1998, 107 (1-4) :169-176
[10]  
DEOGUN S, 1997, DATA MINING TRENDS R