Indirect association: Mining higher order dependencies in data

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

Volumn 1910, Issue , 2000, Pages 632-637

  Tan, Pang Ning ^a   Kumar, Vipin ^a   Srivastava, Jaideep ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRONIC TRADING;

APRIORI; HIGHER-ORDER; INDIRECT ASSOCIATION; ITEM SETS; ITEMPAIRS; MINIMUM SUPPORT; MINING ASSOCIATIONS; NOVEL PATTERNS;

DATA MINING;

EID: 84974733652     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45372-5_77     Document Type: Conference Paper

References (8)

1. R. Agrawal, T. Imielinski, and A. Swami. Database mining: a performance perspec-tive. IEEE Transactions on Knowledge and Data Engineering, 5: 914-925, 1993.
2. T. Brijs, G. Swinnen, K. Vanhoof, and G. Wets. Using association rules for product assortment decisions: A case study. In Proc. KDD’99, San Diego, August 1999.
3. S. Brin, R. Motwani, and C. Silverstein. Beyond market baskets: Generalizing association rules to correlations. In Proc. SIGMOD’97, Tucson, AZ, 1997.
4. G. Das, H. Mannila, and P. Ronkainen. Similarity of attributes by external probes. In Proc. KDD’98, New York, NY, 1998.
5. D. Melamed. Automatic construction of clean broad-coverage translation lexicons. In 2nd Conf. of the Association for Machine Translation in the Americas, 1996.
6. G. Piatetsky-Shapiro and B. Masand. Estimating campaign benefits and modeling lift. In Proc. KDD’99, San Diego, 1999.
7. P.N. Tan and V. Kumar. Interestingness measures for association patterns: A perspective. Technical Report TR00-036, University of Minnesota, 2000.
8. P.N. Tan, V. Kumar, and J. Srivastava. Indirect association: Mining higher order dependencies in data. Technical Report TR00-037, University of Minnesota, 2000.