A scalable approach to balanced, high-dimensional clustering of market-baskets

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

Volumn 1970, Issue , 2000, Pages 525-536

  Strehl, Alexander ^a   Ghosh, Joydeep ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA VISUALIZATION; SALES;

ATTRIBUTE VALUES; BASED CLUSTERING; CLUSTER VISUALIZATION; CUSTOMER PRODUCTS; HIGH-DIMENSIONAL; HIGH-DIMENSIONAL CLUSTERING; RETAIL INDUSTRY; SCALABLE APPROACH;

COMMERCE;

EID: 84947579437     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44467-x_48     Document Type: Conference Paper

References (13)

1. Strehl, A., Ghosh, J.: Value-based customer grouping from large retail data-sets. Proc. SPIE Vol. 4057, (2000) 33-42.
2. Jain, A. K., Dubes, R. C.: Algorithms for Clustering Data. Prentice Hall, New Jersey (1988)
3. Hartigan, J.A.: Clustering Algorithms. Wiley, New York (1975)
4. Rastogi, R., Shim, K.: Scalable algorithms for mining large databases. In Jiawei Han, (ed), KDD-99 Tutorial Notes. ACM (1999)
5. Guha, S., Rastogi, R., Shim, K.: Rock: A robust clustering algorithm for categorical attributes. Proc.15th Int’l Conf. on Data Engineering (1999)
6. Karypis, G., Han, E., Kumar, V.: Chameleon: Hierarchical clustering using dynamic modeling. IEEE Computer, 32(8), (1999) 68-75
7. Bradley, P., Fayyad, U., Reina, C.: Scaling clustering to large databases. In Proc. KDD-98, AAAI Press (1998) 9-15 1998
8. Dhillon, I., Modha, D.: A data clustering algorithm on distributed memory multiprocessors. KDD Workshop on Large-Scale Parallel Systems (1999)
9. Strehl, A., Ghosh, J., Mooney, R.: Impact of similarity measures on web-page clustering. In Proc. AAAI Workshop on AI for Web Search (2000) 58-64
10. Miller, G.L., Teng, S., Vavasis, S.A., A unified geometric approach to graph separators. In Proc. 31st Annual Symposium on Foundations of Computer Science (1991) 538-547
11. Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal of Scientific Computing, 20 1 (1998), 359-392
12. Schloegel, K., Karypis, G., Kumar, V.: Parallel multilevel algorithms for multi-constraint graph partitioning. Technical Report 99-031, Dept of Computer Sc. and Eng, Univ. of Minnesota (1999)
13. Dhillon, I., Modha, D., Spangler, W.: Visualizing class structure of multidimensional data. In S. Weisberg, editor, Proc. 30th Symposium on the Interface: Computing Science and Statistics, (1998)