48 search results - page 6 / 10 » Scalable Techniques for Mining Causal Structures |
KDD
2010
ACM
14 years 11 months ago
2010
ACM
Advances in data collection and storage capacity have made it increasingly possible to collect highly volatile graph data for analysis. Existing graph analysis techniques are not ...
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
90
Voted
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
ICDE
2010
IEEE
15 years 1 months ago
2010
IEEE
Modern science is collecting massive amounts of data from sensors, instruments, and through computer simulation. It is widely believed that analysis of this data will hold the key ...
124
click to vote
ICDM
2009
IEEE
14 years 7 months ago
2009
IEEE
Abstract--The data in many disciplines such as social networks, web analysis, etc. is link-based, and the link structure can be exploited for many different data mining tasks. In t...