5046 search results - page 320 / 1010 » Non-redundant data clustering |
169
click to vote
ICDM
2005
IEEE
16 years 12 days ago
2005
IEEE
We introduce a robust and efficient framework called CLUMP (CLustering Using Multiple Prototypes) for unsupervised discovery of structure in data. CLUMP relies on finding multip...
131
click to vote
ICPR
2000
IEEE
16 years 7 months ago
2000
IEEE
We present a document-specific OCR system and apply it to a corpus of faxed business letters. Unsupervised classification of the segmented character bitmaps on each page, using a ...
179
click to vote
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. We introduce the NP-hard graph-based data clustering problem s-Plex Cluster Vertex Deletion, where the task is to delete at most k vertices from a graph so that the conne...
153
click to vote
FSKD
2005
Springer
16 years 9 days ago
2005
Springer
A new robust clustering scheme based on fuzzy c-means is proposed and the concept of a fuzzy mega-cluster is introduced in this paper. The fuzzy mega-cluster is conceptually simila...
196
click to vote
SGP
2004
15 years 9 months ago
2004
Numerous mesh algorithms such as parametrization, radiosity, and collision detection require the decomposition of meshes into a series of clusters. In this paper we present two no...