Sciweavers

521 search results - page 23 / 105
» Coring method for clustering a graph
Sort
View
ALT
2008
Springer
16 years 1 months ago
Exploiting Cluster-Structure to Predict the Labeling of a Graph
Abstract. The nearest neighbor and the perceptron algorithms are intuitively motivated by the aims to exploit the “cluster” and “linear separation” structure of the data to...
Mark Herbster
IWPC
2005
IEEE
15 years 9 months ago
Clustering Software Artifacts Based on Frequent Common Changes
Changes of software systems are less expensive and less error-prone if they affect only one subsystem. Thus, clusters of artifacts that are frequently changed together are subsyst...
Dirk Beyer, Andreas Noack
128
Voted
ICCS
2005
Springer
15 years 9 months ago
A Multi-level Approach for Document Clustering
Abstract. The divisive MinMaxCut algorithm of Ding et al. [3] produces more accurate clustering results than existing document cluster methods. Multilevel algorithms [4, 1, 5, 7] h...
Suely Oliveira, Sang-Cheol Seok
APPML
2002
58views more  APPML 2002»
15 years 3 months ago
Layered clusters of tightness set functions
A method for structural clustering is proposed involving data on subset-to-entity linkages that can be calculated with structural data such as graphs or sequences or images. The m...
Boris Mirkin, Ilya B. Muchnik
PAMI
2010
164views more  PAMI 2010»
15 years 2 months ago
Large-Scale Discovery of Spatially Related Images
— We propose a randomized data mining method that finds clusters of spatially overlapping images. The core of the method relies on the min-Hash algorithm for fast detection of p...
Ondrej Chum, Jiri Matas