Sciweavers

248 search results - page 14 / 50
» Perturbation based Large Margin Approach for Ranking
Sort
View
CORR
2012
Springer
170views Education» more  CORR 2012»
12 years 3 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
EDBT
2004
ACM
234views Database» more  EDBT 2004»
14 years 7 months ago
A Condensation Approach to Privacy Preserving Data Mining
In recent years, privacy preserving data mining has become an important problem because of the large amount of personal data which is tracked by many business applications. In many...
Charu C. Aggarwal, Philip S. Yu
ICCV
2009
IEEE
13 years 5 months ago
Efficient multi-label ranking for multi-class learning: Application to object recognition
Multi-label learning is useful in visual object recognition when several objects are present in an image. Conventional approaches implement multi-label learning as a set of binary...
Serhat Selcuk Bucak, Pavan Kumar Mallapragada, Ron...
COLT
2007
Springer
14 years 1 months ago
Prediction by Categorical Features: Generalization Properties and Application to Feature Ranking
We describe and analyze a new approach for feature ranking in the presence of categorical features with a large number of possible values. It is shown that popular ranking criteria...
Sivan Sabato, Shai Shalev-Shwartz
KIVS
2005
Springer
14 years 29 days ago
Ranked Matching for Service Descriptions Using OWL-S
Abstract. Semantic Web services envision the automated discovery and selection of Web services. This can be realised by adding semantic information to advertised services and servi...
Michael C. Jaeger, Gregor Rojec-Goldmann, Christop...