Sciweavers

4196 search results - page 3 / 840
» Unsupervised Learning of Relations
Sort
View
ICML
2006
IEEE
14 years 6 months ago
Higher order learning with graphs
Recently there has been considerable interest in learning with higher order relations (i.e., three-way or higher) in the unsupervised and semi-supervised settings. Hypergraphs and...
Sameer Agarwal, Kristin Branson, Serge Belongie
IJCAI
2001
13 years 6 months ago
Probabilistic Classification and Clustering in Relational Data
Supervised and unsupervised learning methods have traditionally focused on data consisting of independent instances of a single type. However, many real-world domains are best des...
Benjamin Taskar, Eran Segal, Daphne Koller
ICML
2004
IEEE
14 years 6 months ago
K-means clustering via principal component analysis
Principal component analysis (PCA) is a widely used statistical technique for unsupervised dimension reduction. K-means clustering is a commonly used data clustering for unsupervi...
Chris H. Q. Ding, Xiaofeng He
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
14 years 5 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...
COOPIS
2003
IEEE
13 years 10 months ago
Mining for Lexons: Applying Unsupervised Learning Methods to Create Ontology Bases
Ontologies in current computer science parlance are computer based resources that represent agreed domain semantics. This paper first introduces ontologies in general and subseque...
Marie-Laure Reinberger, Peter Spyns, Walter Daelem...