Jon Kleinberg, Christos Papadimitriou, Prabhakar Raghavan  Home/Search
Context Related
| cornell.edu/home/klein...jacm04seg.pdf 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/home/kleinber/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper. Like almost all such problems, it is NP-hard, even in the unit-weight case formulated above. One can define a segmentation problem (and in fact one of several variants) for every classical optimization problem. Segmentation problems are intended to capture certain aspects of the economic basis for data mining [Kleinberg et al. 1998] and clustering; we explain this connection next (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):
28.3%: Approximation Algorithms for Segmentation Problems (Extended.. - Kleinberg, al. (1998) (Correct)
16.5%: 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 (1997) (Correct)
0.1: On targeting Markov segments - Charikar, Kumar, Raghavan.. (1999) (Correct)
Similar documents based on text:
98.0: Unknown - (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/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/kleinberg98segmentation.html" }
Citations (may not include all citations):921 Mining association rules between sets of items in large data.. - Agrawal, Imielinski et al. - 1993
149 Polynomial time approximation schemes for dense instances of.. - Arora, Karger et al. - 1995
50 Approximation algorithms for geometric problems - Bern, Eppstein - 1996
13 Location of bank accounts to optimize float (context) - Cornuejols, Fisher et al. - 1977
11 On two segmentation problems - Alon, Sudakov - 1999
7 Flow-interception problems (context) - Berman, Hodgson et al. - 1995
4 Dissimilarity measures for clustering strings (context) - Coggins - 1983
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.cornell.edu/home/kleinber/): More
On Invariants of Sets of Points or Line Segments Under.. - Huttenlocher, Kleinberg (Correct)
Allocating Bandwidth for Bursty Connections - Kleinberg, Rabani, Tardos (1997) (Correct)
The Localization Problem for Mobile Robots - Kleinberg (1994) (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