Contrast and change mining

Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery

Volumn 1, Issue 3, 2011, Pages 215-230

  Boettcher, Mirko ^a  

^a OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CHANGE ANALYSIS; CHANGE MINING; STRATEGIC ISSUES; SUBFIELDS;

DATA MINING;

EID: 84857151868     PISSN: 19424787     EISSN: 19424795     Source Type: Journal    
DOI: 10.1002/widm.27     Document Type: Article

References (86)

1. Ackoff RL. Creating the Corporate Future: Plan or be Planned for. New York: John Wiley & Sons; 1981.
2. Liu B, Hsu W, HanHS, Xia Y. Mining changes for reallife applications. Proceedings of the 2nd International Conference on Data Warehousing and KnowledgeDiscovery, London: Springer; 2000, 337-346.
3. Kifer D, Ben-David S, Gehrke J. Detecting change in data streams. VLDB '04: Proceedings of the 13th International Conference on Very Large Data Bases. 2004, 180-191.
4. Gaber MM, Zaslavsky A, Krishnaswamy S. Mining data streams: a review. SIGMOD Rec 2005, 34:18-26. doi:http://doi.acm.org/10.1145/1083784.1083789.
5. Dong G, Li J. Efficient mining of emerging patterns: discovering trends and differences. KDD '99: Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: ACM; 1999, 43-52. doi:http://doi.acm.org/ 10.1145/312129.312191.
6. Ganti V, Gehrke J, Ramakrishnan R, Loh WY. A framework for measuring differences in data characteristics. J Comput Syst Sci 2002, 64:542-578. doi:http://dx.doi.org/10.1006/jcss.2001.1808.
7. Novak PK, Lavrač N, Webb GI. Supervised descriptive rule discovery: a unifying survey of contrast set, emerging pattern and subgroup mining. J Mach Learn Res 2009, 10:377-403.
8. Song HS, Kim JK, Kim SH. Mining the change of customer behavior in an internet shopping mall. Expert Syst Appl 2001, 21:157-168.
9. Chen MC, Chiu AL, Chang HH. Mining changes in customer behavior in retail marketing. Expert Syst Appl 2005, 28:773-781.
10. Kim JK, Song HS, Kim TS, Kim HK. Detecting the change of customer behavior based on decision tree analysis. Expert Syst 2005, 22:193-205.
11. Tsai CY, Shieh YC. A change detection method for sequential patterns. Decis Support Syst 2009, 46:501-511. doi:http://dx.doi.org/10.1016/j.dss.2008.09.003.
12. Cormode G, Muthukrishnan S. What's new: finding significant differences in network data streams. IEEE/ ACM Trans Netw 2005, 13:1219-1232. doi:http:// dx.doi.org/10.1109/TNET.2005.860096.
13. Böttcher M, Spiliopoulou M, Höppner F. On exploiting the power of time in data mining. SIGKDD Explor Newsl 2008, 10:3-11.
14. Böttcher M, Nauck D, Borgelt C, Kruse R. A framework for discovering interesting business changes from data. BT Technol J 2006, 24:219-228. doi:http:// dx.doi.org/10.1007/s10550-006-0064-3.
15. Böttcher M, Spott M, Nauck D, Kruse R. Mining changing customer segments in dynamic markets. Expert Syst Appl 2009; 36(1):155-164. doi:http:// dx.doi.org/10.1016/j.eswa.2007.09.006.
16. Chen J, Gupta A. Parametric Statistical Change Point Analysis. Boston, MA: Birkhäuser; 2000.
17. Brodsky B, Darkhovsky B. Nonparametric Methods in Change-Point Problems. Dordrecht, Boston, London: Kluwer Academic Publishers; 2010.
18. Schlimmer JC, Granger RH. Incremental learning from noisy data. Mach Learn 1986, 1:317-354.
19. Widmer G, Kubat M. Learning in the presence of concept drift and hidden contexts. Mach Learn 1996, 23:69-101. doi:http://dx.doi.org/10.1023/A: 1018046501280.
20. Agrawal R, Imielinski T, Swami A. Mining association rules between sets of items in large databases. Proceedings of the ACM SIGMOD International Conference on Management of Data. Washington D.C.: ACM; 1993, 207-216.
21. Wang L, Zhao H, Dong G, Li J. On the complexity of finding emerging patterns. Theor Compu Sci 2005, 335:15-27. doi:http://dx.doi.org/10.1016/ j.tcs.2004.12.014.
22. Dong G, Li J. Mining border descriptions of emerging patterns from dataset pairs. Knowl Inf Syst 2005, 8:178-202. doi:http://dx.doi.org/10.1007/s10115-004-0178-1.
23. Chu CJ, Tseng VS, Liang T. Efficient mining of temporal emerging itemsets from data streams. Expert Syst Appl 2009, 36:885-893. doi:http://dx.doi.org/ 10.1016/j.eswa.2007.10.040.
24. Zhang X, Dong G, Kotagiri R. Exploring constraints to efficiently mine emerging patterns from large high-dimensional datasets. KDD '00: Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: ACM; 2000, 310-314. doi:http://doi.acm.org/ 10.1145/347090.347158.
25. Fan H, Ramamohanarao K. Efficiently mining interesting emerging patterns. Advances in Web-Age Information Management, Lecture Notes in Computer Science, vol. 2762, Berlin, Heidelberg, New York: Springer; 2003, 189-201. doi:10.1007/b11939.
26. Soulet A, Crémilleux B, Rioult F. Condensed representation of emerging patterns. Advances in Knowledge Discovery and Data Mining, 8th Pacific-Asia Conference, PAKDD 2004, Lecture Notes in Computer Science, vol. 3056, Berlin, Heidelberg, New York: Springer; 2004, 127-132.
27. Liu B, Hsu W, Ma Y. Discovering the set of fundamental rule changes. KDD '01: Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: ACM; 2001, 335-340. doi:http://doi.acm.org/10.1145/502512.502561.
28. Li J, Dong G, Ramamohanarao K. Making use of the most expressive jumping emerging patterns for classification. Knowl Inf Syst 2001, 3:1-29.
29. Han J, Fu Y. Exploration of the power of attributeoriented induction in data mining. In: Fayyad UM, Piatetsky-Shapiro G, Smyth P, Uthurusamy R eds. Advances in Knowledge Discovery and Data Mining. Menlo Park, CA: AAAI/MIT Press; 1996, 83-115.
30. Terlecki P, Walczak K. On the relation between rough set reducts and jumping emerging patterns. Inf Sci 2007, 177:74-83. doi:DOI:10.1016/j.ins. 2006.04.002.
31. Bay SD, Pazzani MJ. Detecting change in categorical data: mining contrast sets. KDD '99: Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York: ACM; 1999, 302-306. doi:http://doi.acm.org/ 10.1145/312129.312263.
32. Bay SD, Pazzani MJ. Detecting group differences: Mining contrast sets. Data Min Knowl Discovery 2001, 5:213-246. doi:http://dx.doi.org/10.1023/A: 1011429418057.
33. Hilderman RJ, Peckham T. A statistically sound alternative approach to mining contrast sets. Proceedings of the 4th Australasian Data Mining Conference (AusDM-05), 2005, 157-172.
34. Wong TT, Tseng KL. Mining negative contrast sets from data with discrete attributes. Expert Syst Appl 2005, 29:401-407.
35. Webb GI, Butler S, Newlands D. On detecting differences between groups. KDD '03: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: ACM; 2003, 256-265. doi:http://doi.acm.org/ 10.1145/956750.956781.
36. Hido S, Idé T, Kashima H, Kubo H, Matsuzawa H. Unsupervised change analysis using supervised learning. Proceedings of the 12th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD 2008), Lecture Notes in Computer Science, vol. 5012, Berlin, Heidelberg, New York: Springer; 2008, 148-159.
37. Wrobel S. An algorithm for multi-relational discovery of subgroups. PKDD '97: Proceedings of the 1st European Symposium on Principles of Data Mining and KnowledgeDiscovery, Lecture Notes in Computer Science, vol. 1263, London: Springer-Verlag; 1997, 78-87.
38. Breiman L, Friedman J, Olshen R, Stone C. Classification and Regression Trees. Belmont, CA: Wadsworth; 1984.
39. Quinlan JR. Induction of decision trees. Mach Learn 1986, 1:81-106.
40. Bille P. A survey on tree edit distance and related problems. Theor Comput Sci 2005, 337:217-239. doi:http://dx.doi.org/10.1016/j.tcs.2004.12.030.
41. Jiang T, Wang L, Zhang K. Alignment of trees-an alternative to tree edit. Theor Comput Sci 1995, 143:137-148.
42. Breiman L. The heuristics of instability in model selection. Ann Stat 1996, 24:2350-2383.
43. Ganti V, Gehrke J, Ramakrishnan R. A framework for measuring changes in data characteristics. PODS '99: Proceedings of the 18th ACM SIGMODSIGACT- SIGART Symposium on Principles of Database Systems. New York: ACM; 1999, 126-137. doi:http://doi.acm.org/10.1145/303976.303989.
44. Wang K, Zhou S, Fu AWC, Yu JX. Mining changes of classification by correspondence tracing. Proceedings of the 3rd SIAM International Conference on Data Mining (SDM-03). Philadelphia, PA: SIAM; 2003, 95-106.
45. Sarawagi S. Explaining differences in multidimensional aggregates. VLDB '99: Proceedings of the 25th International Conference on Very Large Data Bases. San Francisco, CA: Morgan Kaufmann Publishers Inc.; 1999, 42-53.
46. Agarwal D, Barman D, Gunopulos D, Young NE, Korn F, Srivastava D. Efficient and effective explanation of change in hierarchical summaries. KDD '07: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: ACM; 2007, 6-15. doi:http://doi.acm.org/ 10.1145/1281192.1281197.
47. Jain AK, Dubes RC. Algorithms for clustering data. Upper Saddle River, NJ: Prentice-Hall, Inc.; 1988.
48. Jain AK, LawMHC. Data clustering: a user's dilemma. In: Pal SK, Bandyopadhyay S, Biswas S, eds. First International Conference on Pattern Recognition and Machine Intelligence (PReMI 2005), Lecture Notes in Computer Science, vol. 3776, Springer; 2005, 1-10. doi:http://dx.doi.org/10.1007/115903161.
49. Höppner F, Böttcher M. Matching partitions over time to reliably capture local clusters in noisy domains. PKDD 2007: Proceedings of the 11th European Conference on Principles and Practice of Knowledge Discovery in Databases. Berlin, Heidelberg: Springer- Verlag; 2007, 479-486. doi:http://dx.doi.org/10.1007/978-3-540-74976-949.
50. Denny, Squire DM. Visualization of cluster changes by comparing self-organizing maps. Proceedings of the 9th Pacific-Asia Conference on Knowledge Discovery and Data Mining, Lecture Notes in Computer Science, vol. 3518, Berlin, Heidelberg: Springer-Verlag; 2005, 410-419.
51. Kohonen T. Self-Organization and Associative Memory. 3rd ed. New York: Springer-Verlag, Inc.; 1989.
52. Denny, Williams GJ, Christen P. Redsom: relative density visualization of temporal changes in cluster structures using self-organizing maps. ICDM '08: Proceedings of the 8th IEEE International Conference on Data Mining. Washington, DC: IEEE Computer Society; 2008, 173-182. doi:http://dx.doi.org/10.1109/ICDM.2008.34.
53. Denny, Williams GJ, Christen P. Visualizing temporal cluster changes using relative density selforganizing maps. Knowl Inf Syst 2009, 25:281-302. doi: 10.1007/s10115-009-0264-5.
54. Aggarwal CC, Han J, Wang J, Yu PS. A framework for clustering evolving data streams. VLDB '2003: Proceedings of the 29th International Conference on Very Large Data Bases, VLDB Endowment, 2003, 81-92.
55. Chen K, Liu L. HE-tree: a framework for detecting changes in clustering structure for categorical data streams. VLDB J 2009, 18:1241-1260.
56. Bartolini I, Ciaccia P, Ntoutsi I, Patella M, Theodoridis Y. A unified and flexible framework for comparing simple and complex patterns. PKDD '04: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases, Lecture Notes In Computer Science, vol. 3202, New York: Springer-Verlag, Inc.; 2004, 496-499.
57. Bartolini I, Ciaccia P, Ntoutsi I, Patella M, Theodoridis Y. The PANDA framework for comparing patterns. Data Knowl Eng 2009, 68:244-260. doi:http:// dx.doi.org/10.1016/j.datak.2008.10.004.
58. Roddick JF, Spiliopoulou M, Lister D, Ceglar A. Higher order mining. SIGKDD Explor Newsl 2008, 10:5-17. doi:http://doi.acm.org/10.1145/1412734. 1412736.
59. Liu B, Tuzhilin A. Managing large collections of data mining models. Commun ACM 2008, 51:85-89. doi:http://doi.acm.org/10.1145/1314215.1314230.
60. Geng L, Hamilton HJ. Interestingness measures for data mining: a survey. ACM Comput Surv 2006, 38:9. doi:http://doi.acm.org/10.1145/1132960.1132963.
61. Chatfield C. The Analysis of Time Series-An Introduction. Boca Raton, London, New York: Chapman and Hall/CRC; 1996.
62. Chatfield C. Time-Series Forecasting. Boca Raton, London, New York: Chapman and Hall/CRC; 2001.
63. Agrawal R, Psaila G. Active data mining. In: Fayyad UM, Uthurusamy R, eds. Proceedings of the 1st ACM SIGKDD International Conference on KnowledgeDiscovery and Data Mining. Menlo Park, CA: AAAI Press; 1995, 3-8.
64. Au WH, Chan K. Mining changes in association rules: a fuzzy approach. Fuzzy Sets Syst 2005, 149:87-104.
65. Steinbrecher M, Kruse R. Identifying temporal trajectories of association rules with fuzzy descriptions. Proceedings of North American Fuzzy Information Processing Society (NAFIPS 2008), 2008, 1-6.
66. Goldin DQ, Kanellakis PC. On similarity queries for time-series data: constraint specification and implementation. Proceedings of the 1st International Conference on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, vol. 976, Berlin, Heidelberg, New York: Springer; 1995, 137-153.
67. Rafiei D, Mendelzon A. Similarity-based queries for time series data. Proceedings of the ACM SIGMOD International Conference on Management of Data. New York: ACM Press; 1997, 13-25. doi:http://doi. acm.org/10.1145/253260.253264.
68. Liu B, Ma Y, Lee R. Analyzing the interestingness of association rules from the temporal dimension. Proceedings of the IEEE International Conference on Data Mining. Berlin, Heidelberg, New York: IEEE Computer Society; 2001, 377-384.
69. Böttcher M, Nauck D, Ruta D, Spott M. Towards a framework for change detection in datasets. In: Bramer M, Coenen F, Tuson A, eds. Research and Development in Intelligent Systems XXIII, Proceedings of AI-2006, the 26th SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence, London: BCS SGAI, Springer; 2006, 115-128.
70. Russ G, Böttcher M, Nauck D, Kruse R. Relevance feedback for association rules by leveraging concepts from information retrieval. In: Bramer M, Coenen F, Petridis M, eds. Research and Development in Intelligent Systems XXIV, Proceedings of AI-2007, the 27th SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence, London: BCS SGAI, Springer; 2007, 253-266. doi:http://dx.doi.org/10.1007/978-1-84800-094-0 19.
71. Baron S. Temporale Aspekte entdeckten Wissens-Ein Bezugssystem für die Evolution vonMustern. PhD Thesis, Humboldt University, Berlin; 2004.
72. Baron S, Spiliopoulou M, Günther O. Efficient monitoring of patterns in data mining environments. Proceedings of the 7th East-European Conference on Advances in Databases and Information Systems (ADBIS'03), Lecture Notes in Computer Science, vol. 2798, Berlin, Heidelberg, New York: Springer; 2003, 253-265.
73. Baron S, Spiliopoulou M. Monitoring the evolution of web usage patterns. First European Web Mining Forum, Workshop at ECML/PKDD 2003, 2003.
74. Chakrabarti S, Sarawagi S, Dom B. Mining surprising patterns using temporal description length. VLDB '98: Proceedings of the 24th International Conference on Very Large Databases, Morgan Kaufmann Publishers Inc.; 1998, 606-617.
75. Rissanen J. Modeling by shortest data description. Automatica 1978, 14:465-471.
76. Zhou A, Cao F, Qian W, Jin C. Tracking clusters in evolving data streams over sliding windows. Knowl Inf Syst 2008, 15:181-214. doi:http://dx.doi.org/ 10.1007/s10115-007-0070-x.
77. Tang L, Tang CJ, Duan L, Li C, Jiang YX, Zeng CQ, Zhu J. Movstream: an efficient algorithm for monitoring clusters evolving in data streams. IEEE International Conference on Granular Computing (GrC 2008), IEEE Computer Society; 2008, 582-587. doi:10.1109/GRC.2008.4664715.
78. Spiliopoulou M, Ntoutsi I, Theodoridis Y, Schult R. MONIC: modeling and monitoring cluster transitions. Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York: ACM; 2006, 706-711. doi:http://doi.acm.org/10.1145/1150402.1150491.
79. Oliveira M, Gama J. Bipartite graphs for monitoring clusters transitions. Advances in Intelligent Data Analysis IX, Lecture Notes in Computer Science, vol. 6065, Berlin/Heidelberg: Springer; 2010, 114-124. doi:10.1007/978-3-642-13062-5 12.
80. Welch WJ. Algorithmic complexity: three NP-hard problems in computational statistics. J Stat Comput Simul 1982, 15:17-25.
81. Wang Y, Liu SX, Feng J, Zhou L. Mining naturally smooth evolution of clusters from dynamic data. Proceedings of the 7th SIAM International Conference on Data Mining. Philadelphia, PA: SIAM; 2007.
82. Kubat M. Floating approximation in time-varying knowledge bases. Pattern Recognit Lett 1989, 10:223-227.
83. Helmbold DP, Long PM. Tracking drifting concepts by minimizing disagreements. Mach Learn 1994, 14:27-45.
84. Kuh A, Petsche T, Rivest RL. Learning time-varying concepts. NIPS-3: Proceedings of the 1990 Conference on Advances in Neural Information Processing Systems 3, San Francisco, CA: Morgan Kaufmann Publishers Inc.; 1990, 183-189.
85. Lanquillon C, Renz I. Adaptive information filtering: detecting changes in text streams. CIKM '99: Proceedings of the 8th International Conference on Information and Knowledge Management, New York: ACM; 1999, 538-544. doi:http://doi.acm.org/ 10.1145/319950.320061.
86. Stanley K. Learning concept drift with a committee of decision trees. Technical Report UT-AI-TR-03-302, Department of Computer Science, University of Texas at Austin, TX: 2003.