Sciweavers

1405 search results - page 108 / 281
» Anytime Algorithm for Feature Selection
Sort
View
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
16 years 2 months ago
Selection, combination, and evaluation of effective software sensors for detecting abnormal computer usage
We present and empirically analyze a machine-learning approach for detecting intrusions on individual computers. Our Winnowbased algorithm continually monitors user and system beh...
Jude W. Shavlik, Mark Shavlik
ISNN
2011
Springer
14 years 5 months ago
Orthogonal Feature Learning for Time Series Clustering
This paper presents a new method that uses orthogonalized features for time series clustering and classification. To cluster or classify time series data, either original data or...
Xiaozhe Wang, Leo Lopes
NIPS
2007
15 years 3 months ago
Fast and Scalable Training of Semi-Supervised CRFs with Application to Activity Recognition
We present a new and efficient semi-supervised training method for parameter estimation and feature selection in conditional random fields (CRFs). In real-world applications suc...
Maryam Mahdaviani, Tanzeem Choudhury
IJCV
2008
192views more  IJCV 2008»
15 years 2 months ago
Learning to Locate Informative Features for Visual Identification
Object identification (OID) is specialized recognition where the category is known (e.g. cars) and the algorithm recognizes an object's exact identity (e.g. Bob's BMW). ...
Andras Ferencz, Erik G. Learned-Miller, Jitendra M...
BMCBI
2010
178views more  BMCBI 2010»
15 years 2 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...