Jon Kleinberg, Christos Papadimitriou, Prabhakar Raghavan  Home/Search
Context Related
| cornell.edu/Info/People...stoc98seg.ps cornell.edu/home/kleinb...stoc98seg.ps cornell.edu/home/kleinb...stoc98seg.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cornell.edu/Info/People/kleinb... (more) From: cornell.edu/home/kleinber/ (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We introduce and study a novel genre of optimization problems, which we call segmentation problems. Our motivation, in part, is the development of a framework for evaluating certain data mining and clustering operations in terms of their utility in decision-making. For any classical optimization problem, the corresponding segmentation problem seeks to partition a set of cost vectors into several segments, so that the overall cost is optimized. This framework contains a number of standard... (Update)
Cited by: More
A Microeconomic View of Data Mining - Jon Kleinberg Christos (Correct)
Polynomial Time Approximation Schemes for Geometric k-Clustering - Ostrovsky, Rabani (2001) (Correct)
Dense Itemsets - Seppänen, Mannila (2004) (Correct)
Similar documents (at the sentence level):
38.5%: Approximation Algorithms for Segmentation Problems (Extended.. - Kleinberg, al. (1998) (Correct)
16.7%: Segmentation Problems - Kleinberg, Papadimitriou, Raghavan (1998) (Correct)
Active bibliography (related documents): More All
0.2: ApproxMAP: Approximate Mining of Consensus Sequential Patterns - Kum, Pei, Wang, Duncan (2002) (Correct)
0.1: Authoritative Sources in a Hyperlinked Environment - Kleinberg (1999) (Correct)
0.1: On targeting Markov segments - Charikar, Kumar, Raghavan.. (1999) (Correct)
Similar documents based on text: More All
0.3: Latent Semantic Indexing: A Probabilistic Analysis - Papadimitriou, Raghavan.. (1998) (Correct)
0.2: A deterministic (2-2/(k+1))^n algorithm for k-SAT.. - Dantsin, Goerdt.. (2001) (Correct)
0.2: On the Value of Private Information - Kleinberg, Papadimitriou, Raghavan (2001) (Correct)
Related documents from co-citation: More All
9: Indexing by latent semantic analysis - Deerwester, Dumais et al. - 1990
8: A sublinear time approximation scheme for clustering in metric spaces - Indyk
8: Syntactic clustering of the Web (context) - Broder, Glassman et al. - 1997
BibTeX entry: (Update)
J. Kleinberg, C. H. Papadimitriou, P. Raghavan. "Segmentation problems," Proc. ACM STOC, 1998. http://citeseer.ist.psu.edu/article/kleinberg98segmentation.html More
@inproceedings{ kleinberg98segmentation,
author = "Jon Kleinberg and Christos Papadimitriou and Prabhakar Raghavan",
title = "Segmentation problems",
pages = "473--482",
year = "1998",
url = "citeseer.ist.psu.edu/article/kleinberg98segmentation.html" }
Citations (may not include all citations):921 Mining association rules between sets of items in a large da.. - Agrawal, Imielinski et al. - 1993
805 Algorithms for Clustering Data (context) - Jain, Dubes - 1981
482 Combinatorial Optimization: Algorithms and Complexity (context) - Papadimitriou, Steiglitz - 1997
276 Linear programming and Extensions (context) - Dantzig - 1963
242 Dynamic itemset counting and implication rules for market ba.. - Brin, Motwani et al. - 1997
149 Polynomialtime approximation schemes for dense instances of .. - Arora, Karger et al. - 1995
148 Approximation algorithms for facility location problems - Shmoys, Tardos et al. - 1997
131 Data mining: An overview from a database perspective - Chen, Han et al. - 1996
94 Clustering to minimize the maximum inter-cluster distance (context) - Gonzalez - 1985
80 What makes patterns interesting in knowledge discovery syste.. - Silberschatz, Tuzhilin - 1996
67 Optimal algorithms for approximate clustering (context) - Feder, Greene - 1988
56 Nonlinear Programming: Analysis and Methods (context) - Avriel - 1976
50 Approximation algorithms for geometric problems - Bern, Eppstein - 1996
46 Rule induction using information theory (context) - Smyth, Goodman - 1991
34 An informationtheoretic analysis of hard and soft assignment.. - Kearns, Mansour et al. - 1997
32 The interestingness of deviations - Piatetsky-Schapiro, Matheus - 1994
30 Post-analysis of learned rules - Liu, Hsu - 1996
17 An analysis of the approximations for maximizing submodular .. (context) - Nemhauser, Wolsey et al. - 1978
16 Data Mining Techniques (context) - Berry, Linoff - 1997
13 Location of Bank Accounts to Optimize Float (context) - Cornuejols, Fisher et al. - 1977
8 A comparison of approaches for maximizing business payoff of.. (context) - Masand, Piatetsky-Shapiro - 1996
7 Flowinterception problems (context) - Berman, Hodgson et al. - 1995
4 Dissimilarity measures for clustering strings (context) - Coggins - 1983
3 Data mining, hypergraph transversals, and machine learning (context) - Gunopoulos, Khardon et al. - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://cs.cornell.edu/Info/People/kleinber/): More
Storage Management for Evolving Databases - Kleinberg, Motwani, Raghavan.. (1997) (Correct)
On Invariants of Sets of Points or Line Segments Under.. - Huttenlocher, Kleinberg (Correct)
Allocating Bandwidth for Bursty Connections - Kleinberg, Rabani, Tardos (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC