Sciweavers

142 search results - page 12 / 29
» An Experimental Comparison of Symbolic and Connectionist Lea...
Sort
View
78
Voted
SIGIR
2008
ACM
14 years 9 months ago
Directly optimizing evaluation measures in learning to rank
One of the central issues in learning to rank for information retrieval is to develop algorithms that construct ranking models by directly optimizing evaluation measures used in i...
Jun Xu, Tie-Yan Liu, Min Lu, Hang Li, Wei-Ying Ma
ML
2010
ACM
210views Machine Learning» more  ML 2010»
14 years 8 months ago
Mining frequent closed rooted trees
Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There ...
José L. Balcázar, Albert Bifet, Anto...
ICIP
2008
IEEE
15 years 4 months ago
Learning efficient codes for 3D face recognition
Face representation based on the Visual Codebook becomes popular because of its excellent recognition performance, in which the critical problem is how to learn the most efficien...
Cheng Zhong, Zhenan Sun, Tieniu Tan
ML
2002
ACM
146views Machine Learning» more  ML 2002»
14 years 9 months ago
Kernel Matching Pursuit
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...
Pascal Vincent, Yoshua Bengio
ICDM
2005
IEEE
117views Data Mining» more  ICDM 2005»
15 years 3 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...