Sciweavers

358 search results - page 31 / 72
» Learning from labeled and unlabeled data on a directed graph
Sort
View
ICML
2003
IEEE
16 years 18 days ago
Semi-Supervised Learning Using Gaussian Fields and Harmonic Functions
An approach to semi-supervised learning is proposed that is based on a Gaussian random field model. Labeled and unlabeled data are represented as vertices in a weighted graph, wit...
Xiaojin Zhu, Zoubin Ghahramani, John D. Lafferty
ICDM
2008
IEEE
120views Data Mining» more  ICDM 2008»
15 years 6 months ago
Anti-monotonic Overlap-Graph Support Measures
In graph mining, a frequency measure is anti-monotonic if the frequency of a pattern never exceeds the frequency of a subpattern. The efficiency and correctness of most graph pat...
Toon Calders, Jan Ramon, Dries Van Dyck
KDD
2009
ACM
142views Data Mining» more  KDD 2009»
16 years 10 days ago
Quantification and semi-supervised classification methods for handling changes in class distribution
In realistic settings the prevalence of a class may change after a classifier is induced and this will degrade the performance of the classifier. Further complicating this scenari...
Jack Chongjie Xue, Gary M. Weiss
ICB
2009
Springer
184views Biometrics» more  ICB 2009»
15 years 6 months ago
Challenges and Research Directions for Adaptive Biometric Recognition Systems
Biometric authentication using mobile devices is becoming a convenient and important means to secure access to remote services such as telebanking and electronic transactions. Such...
Norman Poh, Rita Wong, Josef Kittler, Fabio Roli
EDBT
2006
ACM
174views Database» more  EDBT 2006»
15 years 12 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...