128 search results - page 3 / 26 » On Mining Closed Sets in Multi-Relational Data |
IEAAIE
2009
Springer
14 years 2 months ago
2009
Springer
Data mining refers to the process of revealing unknown and potentially useful information from a large database. Frequent itemsets mining is one of the foundational problems in dat...
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large...
IPPS
2008
IEEE
14 years 2 months ago
2008
IEEE
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
ICCS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Many knowledge representation mechanisms consist of linkbased structures; they may be studied formally by means of unordered trees. Here we consider the case where labels...