Sciweavers

5092 search results - page 140 / 1019
» Clustering the Feature Space
Sort
View
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
15 years 8 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
CIKM
2006
Springer
15 years 6 months ago
Efficiently clustering transactional data with weighted coverage density
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Hua Yan, Keke Chen, Ling Liu
TSMC
1998
93views more  TSMC 1998»
15 years 4 months ago
Toward a completely automatic neural-network-based human chromosome analysis
Abstract—The application of neural networks (NN’s) to automatic analysis of chromosome images is investigated in this paper. All aspects of the analysis, namely segmentation, f...
Boaz Lerner
ICIP
2006
IEEE
16 years 6 months ago
Spatial and Color Spaces Combination for Natural Scene Text Extraction
Natural scene images brought new challenges for a few years and one of them is text understanding over images or videos. Text extraction which consists to segment textual foregrou...
Bernard Gosselin, Céline Mancas-Thillou
147
Voted
SDM
2009
SIAM
184views Data Mining» more  SDM 2009»
16 years 1 months ago
DensEst: Density Estimation for Data Mining in High Dimensional Spaces.
Subspace clustering and frequent itemset mining via “stepby-step” algorithms that search the subspace/pattern lattice in a top-down or bottom-up fashion do not scale to large ...
Emmanuel Müller, Ira Assent, Ralph Krieger, S...