2932 search results - page 310 / 587 » Higher order mining |
184
click to vote
ICDM
2010
IEEE
15 years 4 months ago
2010
IEEE
Given a large graph, like a computer network, which k nodes should we immunize (or monitor, or remove), to make it as robust as possible against a computer virus attack? We need (...
180
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 ...
181
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 ...
196
click to vote
ICDM
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--We propose a framework for discovery of collaborative community structure in Wiki-based knowledge repositories based on raw-content generation analysis. We leverage topic...