Sciweavers

2090 search results - page 2 / 418
» Learning with attribute costs
Sort
View
KDD
1995
ACM
135views Data Mining» more  KDD 1995»
13 years 8 months ago
Rough Sets Similarity-Based Learning from Databases
Manydata mining algorithms developed recently are based on inductive learning methods. Very few are based on similarity-based learning. However, similarity-based learning accrues ...
Xiaohua Hu, Nick Cercone
ICPR
2004
IEEE
14 years 6 months ago
A Probabilistic Approach to Learning Costs for Graph Edit Distance
Graph edit distance provides an error-tolerant way to measure distances between attributed graphs. The effectiveness of edit distance based graph classification algorithms relies ...
Horst Bunke, Michel Neuhaus
WWW
2011
ACM
13 years 8 days ago
Learning facial attributes by crowdsourcing in social media
Facial attributes such as gender, race, age, hair style, etc., carry rich information for locating designated persons and profiling the communities from image/video collections (...
Yan-Ying Chen, Winston H. Hsu, Hong-Yuan Mark Liao
ISCI
2007
170views more  ISCI 2007»
13 years 5 months ago
Automatic learning of cost functions for graph edit distance
Graph matching and graph edit distance have become important tools in structural pattern recognition. The graph edit distance concept allows us to measure the structural similarit...
Michel Neuhaus, Horst Bunke
AUSAI
2005
Springer
13 years 11 months ago
Ensemble Selection for SuperParent-One-Dependence Estimators
SuperParent-One-Dependence Estimators (SPODEs) loosen Naive-Bayes’ attribute independence assumption by allowing each attribute to depend on a common single attribute (superpare...
Ying Yang, Kevin B. Korb, Kai Ming Ting, Geoffrey ...