2227 search results - page 295 / 446 » Graph Mining based on a Data Partitioning Approach |
194
click to vote
VLDB
1999
ACM
1999
ACM
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
15 years 7 months ago
Many applications require the clustering of large amounts of high-dimensional data. Most clustering algorithms, however, do not work e ectively and e ciently in highdimensional sp...
137
Voted
SIAMSC
2010
14 years 10 months ago
2010
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...
118
Voted
IJCPOL
2008
15 years 3 months ago
2008
One of the unique challenges to Chinese Language Processing is cross-strait named entity recognition. Due to the adoption of different transliteration strategies, foreign name tra...
110
click to vote
ICIP
2006
IEEE
16 years 5 months ago
2006
IEEE
The region-based description of multispectral images enables important high-level tasks such as data mining and retrieval, and region-of-interest selection. In order to obtain an ...
121
click to vote
CIMCA
2005
IEEE
15 years 9 months ago
2005
IEEE
The classification task is one of the most important problems in the area of data mining. In this paper we propose a new algorithm for addressing this problem. The main idea deriv...