Separating structure from interestingness

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3056, Issue , 2004, Pages 476-485

  Mielikäinen, Taneli ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX OPTIMIZATION; ECONOMIC AND SOCIAL EFFECTS; DATA MINING; DATABASE SYSTEMS; OPTIMIZATION; PATTERN RECOGNITION; PROBLEM SOLVING; SET THEORY;

BUILDING BLOCKES; CONDENSED REPRESENTATIONS; FREQUENT CLOSED SETS; INDUCTIVE DATABASE; INTERESTINGNESS; PATTERN COLLECTIONS; SAMPLE COMPLEXITY; THEORETICAL FRAMEWORK;

DATA MINING; ARTIFICIAL INTELLIGENCE;

CONVEX OPTIMIZATION; PATTERN COLLECTIONS;

EID: 7444227021     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24775-3_58     Document Type: Conference Paper

References (27)

1. Hand, D.J.: Pattern detection and discovery. In Hand, D., Adams, N., Bolton, R., eds.: Pattern Detection and Discovery. Volume 2447 of Lecture Notes in Artificial Intelligence., Springer-Verlag (2002) 1–12
2. Mannila, H.: Local and global methods in data mining: Basic techniques and open problems. In Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R., eds.: Automata, Languages and Programming. Volume 2380 of Lecture Notes in Computer Science., Springer-Verlag (2002) 57–68
3. Goethals, B., Zaki, M.J., eds.: Proceedings of the Workshop on Frequent Itemset Mining Implementations (FIMI-03), Melbourne Florida, USA, November 19, 2003. Volume 90 of CEUR Workshop Proceedings. (2003) http://CEUR-WS.org/Vol-90/.
4. Mannila, H., Toivonen, H.: Multiple uses of frequent sets and condensed representations. In Simoudis, E., Han, J., Fayyad, U.M., eds.: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD-96), AAAI Press (1996) 189–194
5. De Raedt, L.: A perspective on inductive databases. SIGKDD Explorations 4 (2003) 69–77
6. Imielinski, T., Mannila, H.: A database perspective on knowledge discovery. Communications of The ACM 39 (1996) 58–64
7. Mannila, H.: Inductive databases and condensed representations for data mining. In Maluszynski, J., ed.: Logic Programming, MIT Press (1997) 21–30
8. Mannila, H.: Theoretical frameworks for data mining. SIGKDD Explorations 1 (2000) 30–32
9. Gunopulos, D., Khardon, R., Mannila, H., Saluja, S., Toivonen, H., Sharma, R.S.: Discovering all most specific sentences. ACM Transactions on Database Systems 28 (2003) 140–174
10. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In Beeri, C., Buneman, P., eds.: Database Theory - ICDT’99. Volume 1540 of Lecture Notes in Computer Science., Springer-Verlag (1999) 398–416
11. Boulicaut, J.F., Bykowski, A., Rigotti, C.: Free-sets: a condensed representation of Boolean data for the approximation of frequency queries. Data Mining and Knowledge Discovery 7 (2003) 5–22
12. Bykowski, A., Rigotti, C.: A condensed representation to find frequent patterns. In: Proceedings of the Twenteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, ACM (2001)
13. Kryszkiewicz, M.: Concise representation of frequent patterns based on disjunctionfree generators. In Cercone, N., Lin, T.Y., Wu, X., eds.: Proceedings of the 2001 IEEE International Conference on Data Mining, IEEE Computer Society (2001) 305–312
14. Calders, T., Goethals, B.: Mining all non-derivable frequent itemsets. In Elomaa, T., Mannila, H., Toivonen, H., eds.: Principles of Data Mining and Knowledge Discovery. Volume 2431 of Lecture Notes in Artificial Intelligence., Springer-Verlag (2002) 74–865
15. Pei, J., Dong, G., Zou, W., Han, J.: On computing condensed pattern bases. In: Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), IEEE Computer Society (2002) 378–385
16. Mielikäinen, T., Mannila, H.: The pattern ordering problem. In Lavrac, N., Gamberger, D., Todorovski, L., Blockeel, H., eds.: Knowledge Discovery in Databases: PKDD 2003. Volume 2838 of Lecture Notes in Artificial Intelligence., Springer- Verlag (2003) 327–338
17. Mielikäinen, T.: Chaining patterns. In Grieser, G., Tanaka, Y., Yamamoto, A., eds.: Discovery Science. Volume 2843 of Lecture Notes in Artificial Intelligence., Springer-Verlag (2003) 232–243
18. Toivonen, H.: Sampling large databases for association rules. In Vijayaraman, T., Buchmann, A.P., Mohan, C., Sarda, N.L., eds.: VLDB’96, Proceedings of 22nd International Conference on Very Large Data Bases, Morgan Kaufmann (1996) 134–145
19. Boros, E., Gurvich, V., Khachiyan, L., Makino, K.: On the complexity of generating maximal frequent and minimal infrequent sets. In Alt, H., Ferreira, A., eds.: STACS 2002. Volume 2285 of Lecture Notes in Computer Science., Springer-Verlag (2002) 133–141
20. Ausiello, G., Crescenzi, P., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer-Verlag (1999)
21. Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.S.: The online set cover problem. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, ACM (2003) 100–105
22. Ioannidis, Y.: Approximations in database systems. In Calvanese, D., Lenzerini, M., Motwani, R., eds.: Database Theory – ICDT 2003. Volume 2572 of Lecture Notes in Computer Science. (2003)
23. Mielikäinen, T.: Finding all occurring sets of interest. In Boulicaut, J.F., Džeroski, S., eds.: 2nd International Workshop on Knowledge Discovery in Inductive Databases. (2003) 97–106
24. Matoušek, J.: Geometric Discrepancy: An Illustrated Guide. Volume 18 of Algorithms and Combinatorics. Springer-Verlag (1999)
25. Chazelle, B.: The Discrepancy Method: Randomness and Complexity. Paperback edn. Cambridge University Press (2001)
26. Ben-Tal, A., Nemirovksi, A.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. Volume 2 of MPS-SIAM Series on Optimization. SIAM (2001)
27. de Farias Jr., I.R., Nemhauser, G.L.: A polyhedral study of the cardinality constrained knapsack problem. Mathematical Programming 96 (2003) 439–467