Sciweavers

2137 search results - page 120 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
14 years 11 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
AUSAI
2008
Springer
14 years 24 days ago
Clustering with XCS on Complex Structure Dataset
Learning Classifier System (LCS) is an effective tool to solve classification problems. Clustering with XCS (accuracy-based LCS) is a novel approach proposed recently. In this pape...
Liangdong Shi, Yang Gao, Lei Wu, Lin Shang
CORR
2002
Springer
82views Education» more  CORR 2002»
13 years 10 months ago
Using eigenvectors of the bigram graph to infer morpheme identity
This paper describes the results of some experiments exploring statistical methods to infer syntactic categories from a raw corpus in an unsupervised fashion. It shares certain po...
Mikhail Belkin, John A. Goldsmith
ICCV
2009
IEEE
13 years 8 months ago
Building recognition using sketch-based representations and spectral graph matching
In this work, we address the problem of building recognition across two camera views with large changes in scales and viewpoints. The main idea is to construct a semantically rich...
Yu-Chia Chung, Tony X. Han, Zhihai He
ICDM
2010
IEEE
226views Data Mining» more  ICDM 2010»
13 years 8 months ago
Edge Weight Regularization over Multiple Graphs for Similarity Learning
The growth of the web has directly influenced the increase in the availability of relational data. One of the key problems in mining such data is computing the similarity between o...
Pradeep Muthukrishnan, Dragomir R. Radev, Qiaozhu ...