Segmentation problems

Journal of the ACM

Volumn 51, Issue 2, 2004, Pages 263-280

  Kleinberg, Jon ^a,d   Papadimitriou, Christos ^b   Raghavan, Prabhakar ^c  

^a Department of Obstetrics Gynecology   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c Verity ^*  (United States)

^d Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

Approximation algorithms; Clustering; Data mining; Market segmentation

Indexed keywords

APPROXIMATION ALGORITHMS; CLUSTERING; DATABASE MANAGEMENT; MARKET SEGMENTATION;

ALGORITHMS; APPROXIMATION THEORY; DATA MINING; FORMAL LOGIC; OPTIMIZATION; PARAMETER ESTIMATION; PROBLEM SOLVING; SENSITIVITY ANALYSIS; SET THEORY; THEOREM PROVING;

COMPUTATIONAL COMPLEXITY;

EID: 4243171427     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/972639.972644     Document Type: Article

References (18)

1. AGRAWAL, R., IMIELINSKI, T., AND SWAMI, A. N. 1993. Mining association rules between sets of items in large databases. In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data (Washington, D.C.), P. Buneman and S. Jajodia, Eds. ACM, New York, 207-216.
2. ALON, N., AND SUDAKOV, B. 1999. On two segmentation problems. J. Algorithms 33, 1, 173-184.
3. ARORA, S., KARGER, D., AND KARPINSKI, M. 1995. Polynomial time approximation schemes for dense instances of NP-hard problems. In Proceedings of the ACM Symposium on Theory of Computing. ACM, New York, 284-293.
4. BERMAN, O., HODGSON, M., AND KRASS, D. 1995. Flow-interception problems. In Facility Location: A Survey of Applications and Methods, Z. Drezner, Ed. Springer-Verlag, New York.
5. BERN, M., AND EPPSTEIN, D. 1996. Approximation algorithms for geometric problems. In Approximation Algorithms for NP-Hard Problems, D. Hochbaum, Ed. PWS.
6. COGGINS, J. 1983. Dissimilarity measures for clustering strings. In Time Warps, String Edits, and Macromolecules; The Theory and Practice of Sequence Comparison, D. Sankoff and J. Kruskal, Eds. Addison-Wesley, Reading, Mass.
7. CORNUEJOLS, G., FISHER, M., AND NEMHAUSER, G. 1977. Location of bank accounts to optimize float. Manage. Sci. 23, 789-810.
8. FEDER, T., AND GREENE, D. 1988. Optimal algorithms for approximate clustering. In Proceedings of the ACM Symposium on Theory of Computing. ACM, New York.
9. GONZALEZ, T. 1985. Clustering to minimize the maximum inter-cluster distance. Theoret. Comput. Sci. 38, 293-306.
10. JAIN, A. K., AND DUBES, R. C. 1981. Algorithms for Clustering Data. Prentice-Hall, Englewood Cliffs, N.J.
11. KEARNS, M., MANSOUR, Y., AND NG, A. Y. 1997. An information-theoretic analysis of hard and soft assignment methods for clustering. In Proceedings of the 13th Conference on Uncertainty in Artificial Intelligence. 282-293.
12. KLEINBERG, J., PAPADIMITRIOU, C., AND RAGHAVAN, P. 1998. A microeconomic view of data mining. Data Min. Knowl. Disc. 2, 4, 311-324.
13. MASAN, B., AND PIATETSKY-SHAPIRO, G. 1996. A comparison of approaches for maximizing business payoff of prediction models. In Proceedings of the International Conference on Knowledge Discovery and Data Mining. 195-201.
14. NEMHAUSER, G., WOLSEY, L., AND FISHER, M. 1978. An analysis of the approximations for maximizing submodular set functions. Math. Prog. 14, 265-294.
15. PIATETSKY-SHAPIRO, G. AND MATHEUS, C. 1994. The interestingness of deviations. In Proceedings of the International Conference on Knowledge Discovery and Data Mining.
16. SHMOYS, D. B., TARDOS, É., AND AARDAL, K. 1997. Approximation algorithms for facility location problems (extended abstract). In Proceedings of the ACM Symposium on Theory of Computing. ACM, New York, 265-274.
17. SILBERSCHATZ, A., AND TUZHILIN, A. 1996. What makes patterns interesting in knowledge discovery systems, IEEE Trans. Knowl. Data Eng. 8, 970-974.
18. SMYTH, P., AND GOODMAN, R. M. 1991. Rule induction using information theory. In Proceedings of the International Conference on Knowledge Discovery and Data Mining.