1489 search results - page 54 / 298 » Optimizing Feature Sets for Structured Data |
ICDM
2010
IEEE
14 years 7 months ago
2010
IEEE
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
102
click to vote
ECAI
2010
Springer
14 years 7 months ago
2010
Springer
Conditional random fields (CRF) are widely used for predicting output variables that have some internal structure. Most of the CRF research has been done on structured classificati...
JMLR
2010
14 years 4 months ago
2010
In recent years, a fundamental problem structure has emerged as very useful in a variety of machine learning applications: Submodularity is an intuitive diminishing returns proper...
RAID
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we present an accurate and realtime PE-Miner framework that automatically extracts distinguishing features from portable executables (PE) to detect zero-day (i.e. pr...
ICML
2009
IEEE
15 years 4 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...