449 search results - page 66 / 90 » Latent Structure Pattern Mining |
KDD
2008
ACM
14 years 9 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
PAKM
1998
13 years 9 months ago
1998
Knowledge Discovery in Databases (KDD), also known as data mining, focuses on the computerized exploration of large amounts of data and on the discovery of interesting patterns wi...
KDD
2002
ACM
14 years 9 months ago
2002
ACM
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
KDD
2010
ACM
13 years 10 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 ...
BMCBI
2006
13 years 8 months ago
2006
Background: There are many methods for analyzing microarray data that group together genes having similar patterns of expression over all conditions tested. However, in many insta...