Cross-mining binary and numerical attributes

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2007, Pages 481-486

  Garriga, Gemma C ^a   Heikinheimo, Hannes ^a   Seppänen, Jouni K ^a  

^a HELSINKI INSTITUTE FOR INFORMATION TECHNOLOGY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; APPROXIMATION ALGORITHMS; CHLORINE COMPOUNDS; CLUSTERING ALGORITHMS; DATA MINING; DECISION SUPPORT SYSTEMS; FORMAL LOGIC; INFORMATION MANAGEMENT; SEARCH ENGINES;

BINARY ATTRIBUTES; CONSTANT-FACTOR APPROXIMATION ALGORITHMS; DATA SETS; ENVIRONMENTAL VARIABLES; FORMAL DEFINITIONS; GEOGRAPHICAL DATA; INTERNATIONAL CONFERENCES; ITEM SET MINING; ITEMSETS; LOCAL PATTERNS; NUMERICAL ATTRIBUTES;

MINING;

EID: 49749130816     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2007.32     Document Type: Conference Paper

References (21)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In ACM SIGMOD, pages 207-216, 1993.
2. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. Verkamo. Fast discovery of association rules. Adv. Knowl. Disc. and Data Mining, pages 307-328, 1996.
3. D. Burdick, M. Calimlim, J. Flannick, T. Yiu, and J. Gehrke. MAFIA: A maximal frequent itemset algorithm. IEEE Trans. Knowl. Data Eng., 17(11):1490-1504, 2005.
4. C. Faloutsos and I. Kamel. Beyond uniformity and independence: Analysis of R-trees using the concept of fractal dimension. In ACM PODS-1994, pages 4-13, 1994.
5. T. Feder and D. Greene. Optimal algorithms for approximate clustering. In ACM STOC-1988, pages 434-444, 1988.
6. J. Han and J. Pei. Mining frequent patterns by pattern-growth: methodology and implications. SIGKDD Explor. Newsl., 2(2):14-20, 2000.
7. H. Heikinheimo, M. Fortelius, J. Eronen, and H. Mannila. Biogeography of European land mammals shows environmentally distinct and spatially coherent clusters. J. Biogeography, 34(6):1053-1064, 2007.
8. J. L. Herlocker, J. A. Konstan, L. G. Terveen, and J. T. Riedl. Evaluating collaborative filtering recommender systems. ACM Trans. Inf. Syst., 22(1):5-53, 2004.
9. R. J. Hijmans, S. E. Cameron, J. L. Parra, P. G. Jones, and A. Jarvis. Very high resolution interpolated climate surfaces for global land areas. Intl. J. Climatology, 25(15):1965-1978, 2005.
10. A. K. Jain and R. C. Dubes. Algorithms for clustering data. Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 1988.
11. K. Jain and V. V. Vazirani. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. J. ACM, 48(2):274-296, 2001.
12. D. Kempe, J. Kleinberg, and É. Tardos. Maximizing the spread of influence through a social network. In ACM SIGKDD-2003, pages 137-146, 2003.
13. J. Kleinberg, C. Papadimitriou, and P. Raghavan. A micro-economic view of data mining. Data Min. Knowl. Discov., 2(4):311-324, 1998.
14. J. Kleinberg, C. Papadimitriou, and P. Raghavan. Segmentation problems. J. ACM, 51(2):263-280, 2004.
15. T. Mielikäinen and H. Mannila. The pattern ordering problem. In PKDD 2003, pages 327-338, 2003.
16. A. J. Mitchell-Jones, G. Amori, W. Bogdanowicz, B. Krystufek, P. J. H. Reijnders, F. Spitzenberger, M. Stubbe, J. B. M. Thissen, V. Vohralik, and J. Zima. The Atlas of European Mammals. Poyser, 1999.
17. G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher. An analysis of approximations for maximizing submodular set functions. Math. Prog., 14(1):265-294, 1978.
18. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. In ICDT-1999, pages 398-416, 1999.
19. D. B. Shmoys, É. Tardos, and K. Aardal. Approximation algorithms for facility location problems (extended abstract). In ACM STOC-1997, pages 265-274, 1997.
20. K. Wagstaff, C. Cardie, S. Rogers, and S. Schrödl. Constrained k-means clustering with background knowledge. In ICML 2001, pages 577-584, 2001.
21. Z. Zheng, R. Kohavi, and L. Mason. Real world performance of association rule algorithms. In ACM SIGKDD-2001, pages 401-406, 2001.