Sciweavers

2137 search results - page 155 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
85
Voted
ICMLA
2004
14 years 11 months ago
Outlier detection and evaluation by network flow
Detecting outliers is an important topic in data mining. Sometimes the outliers are more interesting than the rest of the data. Outlier identification has lots of applications, su...
Ying Liu, Alan P. Sprague
ICIAP
2003
ACM
15 years 3 months ago
Color matching by using tuple matching
In this paper we present a new matching method called Tuple Matching (TM), which is an algorithm for matching of signatures. Since signatures can contain arbitrary features like c...
Dirk Balthasar
93
Voted
INFOCOM
2002
IEEE
15 years 3 months ago
On Distinguishing between Internet Power Law Topology Generators
— Recent work has shown that the node degree in the WWW induced graph and the AS-level Internet topology exhibit power laws. Since then several algorithms have been proposed to g...
Tian Bu, Donald F. Towsley
83
Voted
ICCV
2007
IEEE
16 years 5 days ago
Non-Parametric Probabilistic Image Segmentation
We propose a simple probabilistic generative model for image segmentation. Like other probabilistic algorithms (such as EM on a Mixture of Gaussians) the proposed model is princip...
Marco Andreetto, Lihi Zelnik-Manor, Pietro Perona
79
Voted
SMC
2007
IEEE
103views Control Systems» more  SMC 2007»
15 years 4 months ago
A new evaluation measure for information retrieval systems
Abstract— Some of the established approaches to evaluating text clustering algorithms for information retrieval show theoretical flaws. In this paper, we analyze these flaws an...
Martin Mehlitz, Christian Bauckhage, Jér&oc...