Sciweavers

127 search results - page 19 / 26
» Mining Complex Time-Series Data by Learning Markovian Models
Sort
View
SDM
2010
SIAM
256views Data Mining» more  SDM 2010»
13 years 9 months ago
The Application of Statistical Relational Learning to a Database of Criminal and Terrorist Activity
We apply statistical relational learning to a database of criminal and terrorist activity to predict attributes and event outcomes. The database stems from a collection of news ar...
B. Delaney, Andrew S. Fast, W. M. Campbell, C. J. ...
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
13 years 11 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
CVPR
2008
IEEE
14 years 9 months ago
Unsupervised modeling of object categories using link analysis techniques
We propose an approach for learning visual models of object categories in an unsupervised manner in which we first build a large-scale complex network which captures the interacti...
Gunhee Kim, Christos Faloutsos, Martial Hebert
PKDD
2009
Springer
118views Data Mining» more  PKDD 2009»
14 years 2 months ago
The Feature Importance Ranking Measure
Most accurate predictions are typically obtained by learning machines with complex feature spaces (as e.g. induced by kernels). Unfortunately, such decision rules are hardly access...
Alexander Zien, Nicole Krämer, Sören Son...
GRC
2010
IEEE
13 years 8 months ago
Learning Multiple Latent Variables with Self-Organizing Maps
Inference of latent variables from complicated data is one important problem in data mining. The high dimensionality and high complexity of real world data often make accurate infe...
Lili Zhang, Erzsébet Merényi