Frequency-based views to pattern collections

Discrete Applied Mathematics

Volumn 154, Issue 7, 2006, Pages 1113-1139

  Mielikäinen, Taneli ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

Condensed representations of pattern collections; Data mining; Pattern discovery

Indexed keywords

CONSTRAINT THEORY; DATA MINING; FUNCTIONS; PROBLEM SOLVING;

CONDENSED REPRESENTATIONS OF PATTERN COLLECTIONS; LOSS FUNCTIONS; PATTERN DISCOVERY;

PATTERN RECOGNITION;

EID: 33644951530     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2005.08.005     Document Type: Article

References (61)

1. R. Agrawal, T. Imielinski, and A.N. Swami Mining association rules between sets of items in large databases P. Buneman S. Jajodia Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data Washington, DC, 26-28 May 1993 1993 ACM Press New York 207 216
2. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A.I. Verkamo Fast discovery of association rules U.M. Fayyad G. Piatetsky-Shapiro P. Smyth R. Uthurusamy Advances in Knowledge Discovery and Data Mining 1996 AAAI/MIT Press New York 307 328 (Chapter 12)
3. M. Bdoiu, S. Har-Peled, and P. Indyk Approximate clustering via core-sets Proceedings on 34th Annual ACM Symposium on Theory of Computing 19-21 May 2002, Montréal, Québec, Canada 2002 ACM Press New York 250 257
4. R.J. Bayardo Jr., R. Agrawal, and D. Gunopulos Constraint-based rule mining in large, dense databases Data Min. Knowledge Discovery 4 2/3 2000 217 240
5. R. Bayardo, B. Goethals, M.J. Zaki (Eds.), Proceedings of the Workshop on Frequent Itemset Mining Implementations (FIMI-04), Brighton, UK, 1 November 2004, CEUR Workshop Proceedings, vol. 126, 2004, http://CEUR-WS.org/Vol-126/.
6. F. Bonchi, F. Giannotti, A. Mazzanti, D. Pedreschi, ExAnte: anticipated data reduction in constrained pattern mining, in: N. Lavra, D. Gamberger, H. Blockeel, L. Todorovski (Eds.), Knowledge Discovery in Databases: PKDD 2003, Seventh European Conference on Principles and Practice of Knowledge Discovery in Databases, Cavtat-Dubrovnik, Croatia, 22-26 September 2003, Proceedings, Lecture Notes in Artificial Intelligence, vol. 2838, Springer, Berlin, 2003, pp. 59-70.
7. J.-F. Boulicaut, A. Bykowski, Frequent closures as a concise representation for binary data mining, in: T. Terano, H. Liu, A.L.P. Chen (Eds.), Knowledge Discovery and Data Mining, Current Issues and New Applications, Fourth Pacific-Asia Conference, 18-20 April 2000, PAKDD 2000, Kyoto, Japan, Proceedings, Lecture Notes in Computer Science, vol. 1805, Springer, Berlin, 2000, pp. 62-73.
8. J.-F. Boulicaut, A. Bykowski, and C. Rigotti Free-sets: a condensed representation of Boolean data for the approximation of frequency queries Data Min. Knowledge Discovery 7 1 2003 5 22
9. A. Bykowski, and C. Rigotti A condensed representation to find frequent patterns Proceedings of the 20th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems 21-23 May 2001, Santa Barbara, California, USA 2001 ACM Press New York
10. T. Calders, B. Goethals, Mining all non-derivable frequent itemsets, in: T. Elomaa, H. Mannila, H. Toivonen (Eds.), Principles of Data Mining and Knowledge Discovery, Sixth European Conference, PKDD 2002, Helsinki, Finland, 19-23 August 2002, Proceedings, Lecture Notes in Artificial Intelligence, vol. 2431, Springer, Berlin, 2002, pp. 74-865.
11. T. Calders, B. Goethals, Minimal k -free representations of frequent sets, in: N. Lavra, D. Gamberger, H. Blockeel, L. Todorovski (Eds.), Knowledge Discovery in Databases: PKDD 2003, Seventh European Conference on Principles and Practice of Knowledge Discovery in Databases, Cavtat-Dubrovnik, Croatia, 22-26 September 2003, Proceedings, Lecture Notes in Artificial Intelligence, vol. 2838, Springer, Berlin, 2003, pp. 71-82.
12. G. Casas-Garriga, Discovering unbounded episodes in sequential data, in: N. Lavra, D. Gamberger, H. Blockeel, L. Todorovski (Eds.), Knowledge Discovery in Databases: PKDD 2003, Seventh European Conference on Principles and Practice of Knowledge Discovery in Databases, Cavtat-Dubrovnik, Croatia, 22-26 September 2003, Proceedings, Lecture Notes in Artificial Intelligence, vol. 2838, Springer, Berlin, 2003, pp. 83-94.
13. S. Dasgupta, Performance guarantees for hierarchical clustering, in: J. Kivinen, R.H. Sloan (Eds.), Computational Learning Theory, 15th Annual Conference on Computational Learning Theory, COLT 2002, Sydney, Australia, 8-10 July 2002, Proceedings, Lecture Notes in Artificial Intelligence, vol. 2375, Springer, Berlin, 2002, pp. 351-363.
14. W.F. de la Vega, M. Karpinski, C. Kenyon, and Y. Rabani Approximation schemes for clustering problems Proceedings of the 35th Annual ACM Symposium on Theory of Computing 9-11 June 2003, San Diego, CA, USA 2003 ACM Press New York
15. L. De Raedt, M. Jaeger, S.D. Lee, H. Mannila, A theory of inductive query answering, in: V. Kumar, S. Tsumoto (Eds.), Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), 9-12 December 2002, Maebashi City, Japan, IEEE Computer Society, Silver Spring, MD, 2002, pp. 123-130.
16. L. Dehaspe, and H.T.T. Toivonen Discovery of relational association rules S. Deroski N. Lavra Relational Data Mining 2001 Springer Berlin 189 212
17. T. Elomaa, and J. Rousu On the computational complexity of optimal multisplitting Fundam. Inform. 47 1-2 2001 35 52
18. T. Feder, and D.H. Greene Optimal algorithms for approximate clustering Proceedings of the 20th Annual ACM Symposium on Theory of Computing Chicago, IL, 2-4 May 1988 1988 ACM Press New York 434 444
19. W.D. Fisher On grouping for maximum homogeneity J. Amer. Statist. Assoc. 53 284 1958 789 798
20. B. Goethals, J. Van den Bussche, On supporting interactive association rule mining, in: Y. Kambayashi, M.K. Mohania, A.M. Tjoa (Eds.), DaWaK, Lecture Notes in Computer Science, vol. 1874, Springer, Berlin, 2000, pp. 307-316.
21. B. Goethals, J. Van den Bussche, Relational association rules: getting WARMeR, in: D.J. Hand, N.M. Adams, R.J. Bolton (Eds.), Pattern Detection and Discovery, ESF Exploratory Workshop, London, UK, 16-19 September 2002, Proceedings, Lecture Notes in Computer Science, vol. 2447, Springer, Berlin, 2002, pp. 125-139.
22. B. Goethals, M.J. Zaki (Eds.), Proceedings of the Workshop on Frequent Itemset Mining Implementations (FIMI-03), Melbourne, FL, USA, 19 November 2003, CEUR Workshop Proceedings, vol. 90, 2003, http://CEUR-WS.org/Vol-90/.
23. D. Gunopulos, R. Khardon, H. Mannila, S. Saluja, H. Toivonen, and R.S. Sharma Discovering all most specific sentences ACM Trans. Database Systems 28 2 2003 140 174
24. R. Gwadera, M. Atallah, W. Szpankowski, Reliable detection of episodes in event sequences, in: X. Wu, A. Tuzhilin, J. Shavlik (Eds.), Proceedings of the Third IEEE International Conference on Data Mining (ICDM 2003), 19-22 December 2003, Melbourne, FL, USA, IEEE Computer Society Press, Silver Spring, MD, 2003, pp. 67-74.
25. J. Han, J. Pei, Y. Yin, and R. Mao Mining frequent patterns without candidate generation: a frequent-pattern tree approach Data Min. Knowledge Discovery 8 1 2004 53 87
26. D.J. Hand, Pattern detection and discovery, in: D.J. Hand, N.M. Adams, R.J. Bolton (Eds.), Pattern Detection and Discovery, ESF Exploratory Workshop, London, UK, 16-19 September 2002, Proceedings, Lecture Notes in Computer Science, vol. 2447, Springer, Berlin, 2002, pp. 1-12.
27. D.J. Hand, H. Mannila, and P. Smyth Principles of Data Mining 2001 MIT Press Cambridge, MA
28. S. Har-Peled, and B. Sadri How fast is the k -means method? Algorithmica 41 2005 185 202
29. T. Hastie, R. Tibshirani, J. Friedman, The Elements of Statistical Learning: Data Mining, Inference, and Prediction, Springer Series in Statistics, Springer, Berlin, 2001.
30. A. Inokuchi, T. Washio, and H. Motoda Complete mining of frequent patterns from graphs: mining graph data Mach. Learn. 50 2003 321 354
31. Y.E. Ioannidis The history of histograms (abridged) J.C. Freytag P.C. Lockemann S. Abiteboul M.J. Carey P.G. Selinger A. Heuer VLDB 2003, Proceedings of 29th International Conference on Very Large Data Bases 9-12 September 2003, Berlin, Germany 2003 Morgan Kaufmann Los Altos, CA 19 30
32. H.V. Jagadish, N. Koudas, S. Muthukrishnan, V. Poosala, K.C. Sevcik, and T. Suel Optimal histograms with quality guarantees A. Gupta O. Shmueli J. Widom VLDB'98, Proceedings of 24th International Conference on Very Large Data Bases 24-27 August 1998, New York City, New York, USA 1998 Morgan Kaufmann Los Altos, CA 275 286
33. R. Kannan, S. Vempala, and A. Vetta On clusterings: good, bad and spectral J. ACM 51 3 2004 497 515
34. T. Kanungo, D.M. Mount, N.S. Netanyahu, C.D. Piatko, R. Silverman, and A.Y. Wu A local search approximation algorithm for k -means clustering Comput. Geom.: Theory Appl. 28 2004 89 112
35. D. Kifer, J. Gehrke, C. Bucila, and W. White How to quickly find a witness Proceedings of the 22nd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems 9-12 June 2003, San Diego, CA, USA 2003 ACM Press New York 272 283
36. D.E. Knuth Sorting and Searching, The Art of Computer Programming second ed. 1998 Addison-Wesley Reading, MA
37. M. Kryszkiewicz, Concise representation of frequent patterns based on disjunction-free generators, in: N. Cercone, T.Y. Lin, X. Wu (Eds.), Proceedings of the 2001 IEEE International Conference on Data Mining, 29 November-2 December 2001, San Jose, California, USA, IEEE Computer Society Press, Silver Spring, MD, 2001, pp. 305-312.
38. A. Kumar, Y. Sabharwal, and S. Sen A simple linear time (1 + ε ) -approximation algorithm for k -means clustering in any dimensions 45th Symposium on Foundations of Computer Science (FOCS 2004) 17-19 October 2004, Rome, Italy, Proceedings 2004 IEEE Computer Society Press Silver Spring, MD 454 462
39. M. Kurakochi, G. Karypis, Frequent subgraph discovery, in: N. Cercone, T.Y. Lin, X. Wu (Eds.), Proceedings of the 2001 IEEE International Conference on Data Mining, 29 November-2 December 2001, San Jose, California, USA, IEEE Computer Society Press, Silver Spring, MD, 2001, pp. 313-320.
40. L.V.S. Lakshmanan, C.K.-S. Leung, and R.T. Ng Efficient dynamic mining of constrained frequent sets ACM Trans. Database Systems 28 4 2003 337 389
41. J. Maloberti, E. Suzuki, Improving efficiency of frequent query discovery by eliminating non-relevant candidates, in: G. Grieser, Y. Tanaka, A. Yamamoto (Eds.), Discovery Science, Sixth International Conference, DS 2003, Sapporo, Japan, 17-19 October 2003, Proceedings, Lecture Notes in Computer Science, vol. 2843, Springer, Berlin, 2003, pp. 220-232.
42. H. Mannila, Local and global methods in data mining: basic techniques and open problems, in: P. Widmayer, F.T. Ruiz, R.M. Bueno, M. Hennessy, S. Eidenbenz, R. Conejo (Eds.), Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, 8-13 July 2002, Proceedings, Lecture Notes in Computer Science, vol. 2380, Springer, Berlin, 2002, pp. 57-68.
43. H. Mannila, and H. Toivonen Levelwise search and borders of theories in knowledge discovery Data Min. Knowledge Discovery 1 3 1997 241 258
44. H. Mannila, H. Toivonen, and A.I. Verkamo Discovery of frequent episodes in event sequences Data Min. Knowledge Discovery 1 3 1997 259 289
45. T. Mielikäinen, Chaining patterns, in: G. Grieser, Y. Tanaka, A. Yamamoto (Eds.), Discovery Science, Sixth International Conference, DS 2003, Sapporo, Japan, 17-19 October 2003, Proceedings, Lecture Notes in Computer Science, vol. 2843, Springer, Berlin, 2003, pp. 232-243.
46. T. Mielikäinen Finding all occurring sets of interest J.-F. Boulicaut S. Deroski Second International Workshop on Knowledge Discovery in Inductive Databases 2003 97 106
47. T. Mielikäinen, Separating structure from interestingness, in: H. Dai, R. Srikant, C. Zhang (Eds.), Advances in Knowledge Discovery and Data Mining, Eighth Pacific-Asia Conference, PAKDD 2004, Sydney, Australia, 26-28 May 2004, Proceedings, Lecture Notes in Artificial Intelligence, vol. 3056, Springer, Berlin, 2004, pp. 476-485.
48. T. Mielikäinen, H. Mannila, The pattern ordering problem, in: N. Lavra, D. Gamberger, H. Blockeel, L. Todorovski (Eds.), Knowledge Discovery in Databases: PKDD 2003, Seventh European Conference on Principles and Practice of Knowledge Discovery in Databases, Cavtat-Dubrovnik, Croatia, 22-26 September 2003, Proceedings, Lecture Notes in Artificial Intelligence, vol. 2838, Springer, Berlin, 2003, pp. 327-338.
49. N. Pasquier, Y. Bastide, R. Taouil, L. Lakhal, Discovering frequent closed itemsets for association rules, in: C. Beeri, P. Buneman (Eds.), Database Theory - ICDT '99, Seventh International Conference, Jerusalem, Israel, 10-12 January 1999, Proceedings, Lecture Notes in Computer Science, vol. 1540, Springer, Berlin, 1999, pp. 398-416.
50. J. Pei, G. Dong, W. Zou, J. Han, On computing condensed pattern bases, in: V. Kumar, S. Tsumoto (Eds.), Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), 9-12 December 2002, Maebashi City, Japan, IEEE Computer Society Press, Silver Spring, MD, 2002, pp. 378-385.
51. R. Srikant, Q. Vu, and R. Agrawal Mining association rules with item constraints D. Heckerman H. Mannila D. Pregibon Proceedings of the Third International Conference on Knowledge Discovery and Data Mining (KDD-97) Newport Beach, CA, USA, 14-17 August 1997 1997 AAAI Press 67 73
52. P.-N. Tan, V. Kumar, J. Srivastava, Selecting the right interestingness measure for association patterns, in: D. Hand, D. Keim, R. Ng (Eds.), Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 23-26 July 2002, Edmonton, Alberta, Canada, ACM Press, New York, 2002.
53. H. Toivonen Sampling large databases for association rules T.M. Vijayaraman A.P. Buchmann C. Mohan N.L. Sarda VLDB'96, Proceedings of 22nd International Conference on Very Large Data Bases 3-6 September 1996, Mumbai (Bombay), India 1996 Morgan Kaufmann Los Altos, CA 134 145
54. J. Wang, and J. Han BIDE: efficient mining of frequent closed sequences Proceedings of the 20th International Conference on Data Engineering (ICDE 2004) 2004 IEEE Computer Society Silver Spring, MD
55. X. Wang, J.T.L. Wang, D. Shasha, B.A. Shapiro, I. Rigoutsos, and K. Zhang Finding patterns in three-dimensional graphs: algorithms and applications to scientific data mining IEEE Trans. Knowledge Data Eng. 14 4 2002 731 749
56. Y. Xiao, J.-F. Yao, Z. Li, M.H. Dunham, Efficient data mining for maximal frequent subtrees, in: X. Wu, A. Tuzhilin, J. Shavlik (Eds.), Proceedings of the Third IEEE International Conference on Data Mining (ICDM 2003), 19-22 December 2003, Melbourne, FL, USA, IEEE Computer Society, Silver Spring, MD, 2003, pp. 379-386.
57. X. Yan, H. Cheng, J. Han, and D. Xin Summarizing itemset patterns a profile-based approach Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining Chicago, IL, USA, 21-24 August 2005 2005 ACM Press New York
58. X. Yan, J. Han, gSpan: graph-based substructure pattern mining, in: V. Kumar, S. Tsumoto (Eds.), Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), 9-12 December 2002, Maebashi City, Japan, IEEE Computer Society Press, Silver Spring, MD, 2002, pp. 721-724.
59. M.J. Zaki Scalable algorithms for association mining IEEE Trans. Knowledge Data Eng. 12 3 2000 372 390
60. M.J. Zaki SPADE: an efficient algorithm for mining frequent sequences Mach. Learn. 42 2001 31 60
61. M.J. Zaki, Efficiently mining frequent trees in a forest, in: D. Hand, D. Keim, R. Ng (Eds.), Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 23-26 July 2002, Edmonton, Alberta, Canada, ACM Press, New York, 2002.