Mining the change of customer behavior in an internet shopping mall
Expert Systems with ApplicationsPublished 1 October 2001
Hee Seok Song, Jae Kyeong Kim, Soung Hie Kim
Citations170
SJR quartileQ1
SJR score1.85
SNIP2.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper develops a methodology which detects changes of customer behavior automatically from customer profiles and sales data at different time snapshots and develops similarity and difference measures for rule matching to detect all types of change.
Abstract
Understanding and adapting to changes of customer behavior is an important aspect for a internet-based company to survive in a continuously changing environment. The aim of this paper is to develop a methodology which detects changes of customer behavior automatically from customer profiles and sales data at different time snapshots. For this purpose, we first define the three types of changes as emerging pattern, unexpected change and the added/perished rule, then, we develop similarity and difference measures for rule matching to detect all types of change. Finally, the degree of change is evaluated to detect significantly changed rules. Our proposed methodology can evaluate the degree of changes as well as detect all kinds of change automatically from different time snapshot data. A case study on an internet shopping mall for evaluation of this methodology is also provided.
Keywords
Computer ScienceBusiness, Management and Accounting
Choice Reviews OnlineData mining: concepts and techniques
28,877 Citations2012Jiawei Han, Micheline Kamber +1 more
Data mining is the search for new, valuable, and nontrivial information in large volumes of data, a cooperative effort of humans and computers that is possible to put data-mining activities into one of two categories: Predictive data mining, which produces the model of the system described by the given data set, or Descriptive data mining which produces new, nontrivials information based on the available data set.
Mining association rules between sets of items in large databases
14,720 Citations1993Rakesh Agrawal, Tomasz Imieliński +1 more
An efficient algorithm is presented that generates all significant association rules between items in the database of customer transactions and incorporates buffer management and novel estimation and pruning techniques.
ACM SIGMOD RecordMining association rules between sets of items in large databases
4,475 Citations1993Rakesh Agrawal, Tomasz Imieliński +1 more
IEEE Transactions on Knowledge and Data EngineeringDatabase mining: a performance perspective
1,488 Citations1993R. K. Agrawal, Tomasz Imieliński +1 more
The authors' perspective of database mining as the confluence of machine learning techniques and the performance emphasis of database technology is presented and an algorithm for classification obtained by combining the basic rule discovery operations is given.
Machine LearningLearning in the Presence of Concept Drift and Hidden Contexts
1,432 Citations1996Gerhard Widmer, Miroslav Kubát
A family of learning algorithms that flexibly react to concept drift and can take advantage of situations where contexts reappear are described, including a heuristic that constantly monitors the system's behavior.
Efficient mining of emerging patterns
1,005 Citations1999Guozhu Dong, Jinyan Li
It is believed that EPs with low to medium support, such as 1%-20%, can give useful new insights and guidance to experts, in even “well understood” applications.
Machine LearningLearning in the presence of concept drift and hidden contexts
988 Citations1996Gerhard Widmer, Miroslav Kubát
A family of learning algorithms that flexibly react to concept drift and can take advantage of situations where contexts reappear are described, including a heuristic that constantly monitors the system's behavior.
Data Mining and Knowledge DiscoveryDiscretization: An Enabling Technique
979 Citations2002Huan Liu, Farhad Hussain +2 more
This paper aims at a systematic study of discretization methods with their history of development, effect on classification, and trade-off between speed and accuracy.
Maintenance of discovered association rules in large databases: an incremental updating technique
804 Citations2002David W. Cheung, Jiawei Han +2 more
An incremental updating technique is developed for maintenance of the association rules discovered by database mining when new transaction data are added to a transaction database.
Mining association rules with item constraints
769 Citations1997Ramakrishnan Srikant, Quoc Vu +1 more
This work considers the problem of integrating constraints that are Boolean expressions over the presence or absence of items into the association discovery algorithm and presents three integrated algorithms for mining association rules with item constraints and discusses their tradeoffs.
IEEE Transactions on Knowledge and Data EngineeringWhat makes patterns interesting in knowledge discovery systems
675 Citations1996Abraham Silberschatz, Alexander Tuzhilin
The focus of the paper is on studying subjective measures of interestingness, which are classified into actionable and unexpected, and the relationship between them is examined.
Rule discovery from time series
627 Citations1998Gautam Das, King-Ip Lin +3 more
Efficient mining of partial periodic patterns in time series database
581 Citations1999Jiawei Han, Guozhu Dong +1 more
This work presents several algorithms for efficient mining of partial periodic patterns by exploring some interesting properties related to partial periodicity such as the Apriori property and the max-subpattern hit set property, and by shared mining of multiple periods.
Lecture notes in computer scienceFinding similar time series
308 Citations1997Gautam Das, Dimitrios Gunopulos +1 more
This paper presents an intuitive model for measuring the similarity between two time series that takes into account outliers, different scaling functions, and variable sampling rates, and shows the naturalness of this notion of similarity.
An efficient algorithm for the incremental updation of association rules in large databases
218 Citations1997Shiby Thomas, Sreenath Bodagala +2 more
This paper proposes an incremental updating technique based on negative borders, for the maintenance of association rules when new transaction data is added to or deleted from a transaction database.
Using general impressions to analyze discovered classification rules
217 Citations1997Bing Liu, Wynne Hsu +1 more
This paper proposes a technique that analyzes the discovered rules against a specific type of existing knowledge, which is called general impressions, to help the user identify interesting rules.
Detecting change in categorical data
194 Citations1999Stephen D. Bay, Michael J. Pazzani
An algorithm for mining contrast-sets as well as several pruning rules to reduce the computational complexity are provided and a subset that is surprising to the user given what has already been shown is presented.
National University of SingaporePost-analysis of learned rules
149 Citations1996Bing Liu, Wynne Hsu
The proposed technique is general and highly interactive, and will be particularly useful in data mining and data analysis, where the rules may change over time and it is important to know what the changes are.
Machine LearningTracking Drifting Concepts By Minimizing Disagreements
146 Citations1994David P. Helmbold, Philip M. Long
A framework for measuring changes in data characteristics
126 Citations1999Venkatesh Ganti, Johannes Gehrke +1 more
This work develops a framework for quantifying the difference, called the deviation, between two datasets in terms of the models they induce, and captures standard measures of deviation such as the misclassification rate and the chi-squared metric as special cases.
Lecture notes in computer scienceException Rule Mining with a Relative Interestingness Measure
115 Citations2000Farhad Hussain, Huan Liu +2 more
This paper presents a method for mining exception rules based on a novel measure which estimates interestingness relative to its corresponding common sense rule and reference rule and shows through the experiments how this proposed relative measure can give an unbiased estimate of relative interestingness in a rule considering already mined rules.
Knowledge Discovery and Data MiningActive data mining
113 Citations1995Rakesh Agrawal, Giuseppe Psaila
Knowledge Discovery and Data MiningAutonomous discovery of reliable exception rules
113 Citations1997Einoshin Suzuki
A probabilistic estimation approach in which an exception rule associated with a common sense rule in the form of a ride pair is obtained, based on the normal approximations of the multinomial distributions, rule pairs which satisfy, with high confidence, all the specified conditions.
Lecture notes in computer scienceMining Changes for Real-Life Applications
80 Citations2000Bing Liu, Wynne Hsu +2 more
This paper study change mining in the contexts of decision tree classification for real-life applications finds that change mining becomes important for understanding the behaviors of customers.
Machine LearningTracking drifting concepts by minimizing disagreements
75 Citations1994David P. Helmbold, Philip M. Long
This paper shows that if H is properly PAC-learnable, then there is an efficient (randomized) algorithm that with high probability approximately minimizes disagreements to within a factor of 7d + 1, yielding an efficient tracking algorithm forH which tolerates drift rates up to a constant times ε2/(d2 ln 1/ε).
Maintenance of discovered knowledge: a case in multi-level association rules
61 Citations1996David W. Cheung, Vincent Ng +1 more
This study shows that MLUp has a superior performance over ML-T2 in updating discovered MLAR and demonstrates that the incremental technique in FUP and FUP* can be generalized to some other kdd systems.
Lecture notes in computer scienceMaking Use of the Most Expressive Jumping Emerging Patterns for Classification
54 Citations2000Jinyan Li, Guozhu Dong +1 more
Lecture notes in computer scienceLearning under persistent drift
37 Citations1997Yoav Freund, Yishay Mansour
This paper shows in this case how to use a simple weighting scheme to estimate the error of an hypothesis, and using this estimate, to minimize theerror of the prediction.
Mining interesting knowledge using DM-II
15 Citations1999Bing Liu, Wynne Hsu +2 more
This paper presents the unique data mining system DM-II (Data Mining Integration and Interestingness), a PC-based system working in Windows 95/98/NT environment that has a number of unique and advanced sub-systems.
Evaluating usefulness for dynamic classification
13 Citations1998Gholamreza Nakhaeizadeh, Charles Taylor +1 more
It is argued that usefulness can be used to improve the performance of classification rules, as well as to reduce their storage and derivation, in a dynamic setting, in which the distribution of at least one class is changing with time.