Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries

Data Mining and Knowledge Discovery

Volumn 7, Issue 1, 2003, Pages 5-22

  Boulicaut, Jean François ^a   Bykowski, Artur ^a   Rigotti, Christophe ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

Association rules; Condensed representations; Frequent pattern discovery

Indexed keywords

APPROXIMATION THEORY; FORMAL LOGIC; INFORMATION RETRIEVAL; KNOWLEDGE ENGINEERING;

ASSOCIATION RULES; CONDENSED REPRESENTATIONS; FREQUENT PATTERN DISCOVERY; KNOWLEDGE DISCOVERY;

DATA MINING;

EID: 0037243046     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1021571501451     Document Type: Article

References (15)

1. Agrawal, R., Imielinski, T., and Swami, A. 1993. Mining association rules between sets of items in large databases. In Proc. of the 1993 ACM SIGMOD International Conference on Management of Data (SIOMOD'93), Washington, D.C., pp. 207-216.
2. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., and Verkamo, A.I. 1996. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, AAAI Press, pp. 307-328.
3. Agrawal, R. and Srikant, R. 1994. Fast algorithms for mining association rules in large databases. In Proc. of the 20th International Conference on Very Large Data Bases (VLDB'94), Santiago de Chile, Chile, pp. 487-499.
4. Bayardo, R.J. 1997. Brute-force mining of high-confidence classification rules. In Proc. of the Third International Conference on Knowledge Discovery and Data Mining (KDD'97), Newport Beach, California, pp. 123-126.
5. Bayardo, R.J. 1998. Efficiently mining long patterns from databases. In Proc. of the 1998 ACM SIGMOD International Conference on Management of Data (SIGMOD'98), Seattle, Washington, pp. 85-93.
6. Boulicaut, J.-F. and Bykowski, A. 2000. Frequent closures as a concise representation for binary data mining. In Proc. of the Fourth Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD'00), Vol. 1805 of LNAI, Kyoto, JP, Berlin: Springer-Verlag, pp. 62-73.
7. Boulicaut, J.-F., Bykowski, A., and Rigotti, C. to appear. Approximation of frequency queries by mean of free-sets. In Proc. of the 4th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD'00), LNAI, Lyon, France, Berlin: Springer-Verlag.
8. Bykowski, A. and Gomez-Chantada, L. 2000. Frequent itemset extraction in highly-correlated data: A web usage mining application. In Proc. of the 2000 International Workshop on Web Knowledge Discovery and Data Mining (WKDDM'00), Kyoto, Japan, pp. 27-42.
9. Fujiwara, S., Ullman, J.D., and Motwani, R. 2000. Dynamic miss-counting algorithms: Finding implication and similarity rules with confidence pruning. In Proc. of the 16th International Conference on Data Engineering (ICDE'00), San Diego, California, pp. 501-511.
10. Mannila, H. and Toivonen, H. 1996. Multiple uses of frequent sets and condensed representations. In Proc. of the Second International Conference on Knowledge Discovery and Data Mining (KDD'96), Portland, Oregon, pp. 189-194.
11. Mannila, H. and Toivonen, H. 1997. Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery, 1(3):241-258.
12. Ng, R., Lakshmanan, L.V., Han, J., and Pang, A. 1998. Exploratory mining and pruning optimization of constrained association rules. In Proc. of the 1998 ACM SIGMOD International Conference on Management of Data (SIGMOD'98), Seattle, Washington, pp. 13-24.
13. Pasquier, N., Bastide, Y., Taouil, R., and Lakhal, L. 1999. Efficient mining of association rules using closed itemset lattices. Information Systems, 24(1):25-46.
14. Pavlov, D., Mannila, H., and Smyth, P. 2000. Probalistic models for query approximation with large data sets. Technical Report 2000-07, Department of Information and Computer Science, Univsersity of California, Irvine, CA-92697-3425.
15. Piatetsky-Shapiro, G. 1991. Discovery, analysis, and presentation of strong rules. In Knowledge Discovery in Databases, Menlo Park, CA: AAAI Press, pp. 229-248.