Sciweavers

237 search results - page 26 / 48
» Finding Metric Structure in Information Theoretic Clustering
Sort
View
CVPR
2006
IEEE
15 years 11 months ago
Clustering Appearance for Scene Analysis
We propose a new approach called "appearance clustering" for scene analysis. The key idea in this approach is that the scene points can be clustered according to their s...
Sanjeev J. Koppal, Srinivasa G. Narasimhan
IM
2008
14 years 9 months ago
Directed Random Dot Product Graphs
In this paper we consider three models for random graphs that utilize the inner product as their fundamental object. We analyze the behavior of these models with respect to cluster...
Stephen J. Young, Edward R. Scheinerman
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
15 years 10 months ago
Unsupervised learning on k-partite graphs
Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the resear...
Bo Long, Xiaoyun Wu, Zhongfei (Mark) Zhang, Philip...
91
Voted
KDD
2009
ACM
239views Data Mining» more  KDD 2009»
15 years 10 months ago
Applying syntactic similarity algorithms for enterprise information management
: ? Applying Syntactic Similarity Algorithms for Enterprise Information Management Ludmila Cherkasova, Kave Eshghi, Charles B. Morrey III, Joseph Tucek, Alistair Veitch HP Laborato...
Ludmila Cherkasova, Kave Eshghi, Charles B. Morrey...
93
Voted
FLAIRS
2009
14 years 7 months ago
Mining Default Rules from Statistical Data
In this paper, we are interested in the qualitative knowledge that underlies some given probabilistic information. To represent such qualitative structures, we use ordinal conditi...
Gabriele Kern-Isberner, Matthias Thimm, Marc Finth...