7150 search results - page 505 / 1430 » Graph-Based Data Mining |
175
click to vote
AUSDM
2007
Springer
16 years 1 months ago
2007
Springer
Many existing techniques for term extraction are heuristically-motivated and criticised as ad-hoc. The definitions and assumptions critical to set the boundary for the effective...
198
click to vote
ICDM
2005
IEEE
16 years 16 days ago
2005
IEEE
In this paper, we propose a semi-supervised framework for learning a weighted Euclidean subspace, where the best clustering can be achieved. Our approach capitalizes on user-const...
160
click to vote
ICDM
2005
IEEE
16 years 16 days ago
2005
IEEE
This paper presents an application of PageRank for assigning documents with a corresponding geographical scope. We describe the technique in detail, together with its theoretical ...
212
click to vote
ADMA
2005
Springer
2005
Springer
Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem
16 years 14 days ago
In this paper, we design genetic algorithm and simulated annealing algorithm and their parallel versions to solve the Closest String problem. Our implementation and experiments sho...
203
click to vote
AI
2005
Springer
16 years 14 days ago
2005
Springer
Spatial clustering is an active research area in spatial data mining with various methods reported. In this paper, we compare two density-based methods, DBSCAN and DBRS. First, we ...