Sciweavers

4039 search results - page 210 / 808
» A Method for Dynamic Clustering of Data
Sort
View
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
16 years 6 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
SPIESR
2004
118views Database» more  SPIESR 2004»
15 years 7 months ago
New method for visual descriptor evaluation
Evaluation in visual information retrieval is usually performed by executing test queries and calculating recall and precision based on predefined media collections and ground tru...
Horst Eidenberger
ICDM
2003
IEEE
184views Data Mining» more  ICDM 2003»
15 years 11 months ago
Analyzing High-Dimensional Data by Subspace Validity
We are proposing a novel method that makes it possible to analyze high dimensional data with arbitrary shaped projected clusters and high noise levels. At the core of our method l...
Amihood Amir, Reuven Kashi, Nathan S. Netanyahu, D...
CAIP
2005
Springer
133views Image Analysis» more  CAIP 2005»
15 years 11 months ago
Finding the Number of Clusters for Nonparametric Segmentation
Non-parametric data representation can be done by means of a potential function. This paper introduces a methodology for finding modes of the potential function. Two different me...
Nikolaos Nasios, Adrian G. Bors
ESWS
2008
Springer
15 years 8 months ago
Instance Based Clustering of Semantic Web Resources
Abstract. The original Semantic Web vision was explicit in the need for intelligent autonomous agents that would represent users and help them navigate the Semantic Web. We argue t...
Gunnar Aastrand Grimnes, Peter Edwards, Alun D. Pr...