Sciweavers

1622 search results - page 51 / 325
» Learning a Hidden Matching
Sort
View
ICDM
2006
IEEE
137views Data Mining» more  ICDM 2006»
15 years 9 months ago
Mining Complex Time-Series Data by Learning Markovian Models
In this paper, we propose a novel and general approach for time-series data mining. As an alternative to traditional ways of designing specific algorithm to mine certain kind of ...
Yi Wang, Lizhu Zhou, Jianhua Feng, Jianyong Wang, ...
ATAL
2006
Springer
15 years 6 months ago
Learning executable agent behaviors from observation
We present a method for learning a human understandable, executable model of an agent's behavior using observations of its interaction with the environment. By executable we ...
Andrew Guillory, Hai Nguyen, Tucker R. Balch, Char...
KDD
2008
ACM
176views Data Mining» more  KDD 2008»
16 years 3 months ago
Febrl -: an open source data cleaning, deduplication and record linkage system with a graphical user interface
Matching records that refer to the same entity across databases is becoming an increasingly important part of many data mining projects, as often data from multiple sources needs ...
Peter Christen
108
Voted
GECCO
2005
Springer
204views Optimization» more  GECCO 2005»
15 years 8 months ago
Modeling systems with internal state using evolino
Existing Recurrent Neural Networks (RNNs) are limited in their ability to model dynamical systems with nonlinearities and hidden internal states. Here we use our general framework...
Daan Wierstra, Faustino J. Gomez, Jürgen Schm...
ICIP
2010
IEEE
15 years 27 days ago
Learning image similarities via Probabilistic Feature Matching
In this paper, we propose a novel image similarity learning approach based on Probabilistic Feature Matching (PFM). We consider the matching process as the bipartite graph matchin...
Ziming Zhang, Ze-Nian Li, Mark S. Drew