3949 search results - page 653 / 790 » Machine Learning and Data Mining |
154
click to vote
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...
182
click to vote
KDD
2009
ACM
16 years 1 months ago
2009
ACM
Max-margin Markov networks (M3 N) have shown great promise in structured prediction and relational learning. Due to the KKT conditions, the M3 N enjoys dual sparsity. However, the...
162
click to vote
ICDM
2010
IEEE
15 years 4 months ago
2010
IEEE
Consider a typical recommendation problem. A company has historical records of products sold to a large customer base. These records may be compactly represented as a sparse custom...
235
click to vote
JIPS
2010
15 years 1 months ago
2010
Abstract--The Internet explosion and the increase in crucial web applications such as ebanking and e-commerce, make essential the need for network security tools. One of such tools...
182
click to vote
KES
2006
Springer
15 years 6 months ago
2006
Springer
The issue of Automatic Relevance Determination (ARD) has attracted attention over the last decade for the sake of efficiency and accuracy of classifiers, and also to extract knowle...