Sciweavers

83 search results - page 10 / 17
» Rademacher Chaos Complexities for Learning the Kernel Proble...
Sort
View
KDD
2008
ACM
178views Data Mining» more  KDD 2008»
14 years 8 months ago
Training structural svms with kernels using sampled cuts
Discriminative training for structured outputs has found increasing applications in areas such as natural language processing, bioinformatics, information retrieval, and computer ...
Chun-Nam John Yu, Thorsten Joachims
ECCV
2010
Springer
13 years 10 months ago
Clustering Complex Data with Group-Dependent Feature Selection
Abstract. We describe a clustering approach with the emphasis on detecting coherent structures in a complex dataset, and illustrate its effectiveness with computer vision applicat...
KDD
2009
ACM
175views Data Mining» more  KDD 2009»
14 years 7 days ago
Multi-class protein fold recognition using large margin logic based divide and conquer learning
Inductive Logic Programming (ILP) systems have been successfully applied to solve complex problems in bioinformatics by viewing them as binary classification tasks. It remains an...
Huma Lodhi, Stephen Muggleton, Michael J. E. Stern...
BMCBI
2007
154views more  BMCBI 2007»
13 years 7 months ago
Inferring biological networks with output kernel trees
Background: Elucidating biological networks between proteins appears nowadays as one of the most important challenges in systems biology. Computational approaches to this problem ...
Pierre Geurts, Nizar Touleimat, Marie Dutreix, Flo...
COMPGEOM
2011
ACM
12 years 11 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...