Sciweavers

872 search results - page 61 / 175
» Hybrid Learning Scheme for Data Mining Applications
Sort
View
ICDM
2007
IEEE
124views Data Mining» more  ICDM 2007»
14 years 2 months ago
Community Learning by Graph Approximation
Learning communities from a graph is an important problem in many domains. Different types of communities can be generalized as link-pattern based communities. In this paper, we p...
Bo Long, Xiaoyun Xu, Zhongfei (Mark) Zhang, Philip...
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
14 years 2 months ago
Learning Preferences with Hidden Common Cause Relations
Abstract. Gaussian processes have successfully been used to learn preferences among entities as they provide nonparametric Bayesian approaches for model selection and probabilistic...
Kristian Kersting, Zhao Xu
KDD
2003
ACM
127views Data Mining» more  KDD 2003»
14 years 8 months ago
Experiments with random projections for machine learning
Dimensionality reduction via Random Projections has attracted considerable attention in recent years. The approach has interesting theoretical underpinnings and offers computation...
Dmitriy Fradkin, David Madigan
ICDM
2005
IEEE
117views Data Mining» more  ICDM 2005»
14 years 1 months ago
On Learning Asymmetric Dissimilarity Measures
Many practical applications require that distance measures to be asymmetric and context-sensitive. We introduce Context-sensitive Learnable Asymmetric Dissimilarity (CLAD) measure...
Krishna Kummamuru, Raghu Krishnapuram, Rakesh Agra...
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
14 years 8 months ago
Nonlinear adaptive distance metric learning for clustering
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
Jianhui Chen, Zheng Zhao, Jieping Ye, Huan Liu