Sciweavers

2190 search results - page 102 / 438
» Learning with the Set Covering Machine
Sort
View
RSFDGRC
2005
Springer
190views Data Mining» more  RSFDGRC 2005»
14 years 2 months ago
Finding Rough Set Reducts with SAT
Abstract. Feature selection refers to the problem of selecting those input features that are most predictive of a given outcome; a problem encountered in many areas such as machine...
Richard Jensen, Qiang Shen, Andrew Tuson
ICML
2002
IEEE
14 years 10 months ago
Multi-Instance Kernels
Learning from structured data is becoming increasingly important. However, most prior work on kernel methods has focused on learning from attribute-value data. Only recently, rese...
Adam Kowalczyk, Alex J. Smola, Peter A. Flach, Tho...
ML
2002
ACM
128views Machine Learning» more  ML 2002»
13 years 8 months ago
A Simple Method for Generating Additive Clustering Models with Limited Complexity
Additive clustering was originally developed within cognitive psychology to enable the development of featural models of human mental representation. The representational flexibili...
Michael D. Lee
AAAI
2008
13 years 11 months ago
Instance-level Semisupervised Multiple Instance Learning
Multiple instance learning (MIL) is a branch of machine learning that attempts to learn information from bags of instances. Many real-world applications such as localized content-...
Yangqing Jia, Changshui Zhang
ECTEL
2007
Springer
14 years 3 months ago
Knowledge Repositories for Rural Communities of Learning
Knowledge Repositories can be a potential solution in order to cover agricultural professionals' lifelong learning needs. An application area of particular interest is the one...
Argiris Tzikopoulos