Sciweavers

237 search results - page 2 / 48
» Finding Metric Structure in Information Theoretic Clustering
Sort
View
ALT
2003
Springer
15 years 1 months ago
Efficiently Learning the Metric with Side-Information
Abstract. A crucial problem in machine learning is to choose an appropriate representation of data, in a way that emphasizes the relations we are interested in. In many cases this ...
Tijl De Bie, Michinari Momma, Nello Cristianini
RECOMB
2009
Springer
15 years 10 months ago
Finding Biologically Accurate Clusterings in Hierarchical Tree Decompositions Using the Variation of Information
Abstract. Hierarchical clustering is a popular method for grouping together similar elements based on a distance measure between them. In many cases, annotation information for som...
Saket Navlakha, James Robert White, Niranjan Nagar...
ENC
2003
IEEE
15 years 2 months ago
Metrics for Symbol Clustering from a Pseudoergodic Information Source
We discuss a set of metrics, which aims to facilitate the formation of symbol groups from a pseudoergodic information source. An optimal codification can then be applied on the sy...
Angel Fernando Kuri Morales, Oscar Herrera-Alcanta...
WAW
2009
Springer
138views Algorithms» more  WAW 2009»
15 years 4 months ago
Information Theoretic Comparison of Stochastic Graph Models: Some Experiments
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
Kevin J. Lang
CORR
2010
Springer
157views Education» more  CORR 2010»
14 years 9 months ago
Efficient Clustering with Limited Distance Information
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model ...
Konstantin Voevodski, Maria-Florina Balcan, Heiko ...