3719 search results - page 552 / 744 » order 2010 |
172
click to vote
ICDM
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a data set. However, it suffers...
202
click to vote
ICDM
2010
IEEE
15 years 4 months ago
2010
IEEE
There is an increasingly pressing need, by several applications in diverse domains, for developing techniques able to index and mine very large collections of time series. Examples...
177
click to vote
ICDM
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper, we study a new research problem of causal discovery from streaming features. A unique characteristic of streaming features is that not all features can be available ...
179
click to vote
ICDM
2010
IEEE
15 years 4 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...
200
click to vote
ICDM
2010
IEEE
15 years 4 months ago
2010
IEEE
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...