Sciweavers

43 search results - page 4 / 9
» Mining interesting subgraphs by output space sampling
Sort
View
JCB
2007
118views more  JCB 2007»
13 years 7 months ago
Discovering Topological Motifs Using a Compact Notation
Discovering topological motifs or common topologies in one or more graphs is an important as well as an interesting problem. It had been classically viewed as the subgraph isomorp...
Laxmi Parida
CIDM
2009
IEEE
13 years 11 months ago
Empirical comparison of graph classification algorithms
The graph classification problem is learning to classify separate, individual graphs in a graph database into two or more categories. A number of algorithms have been introduced fo...
Nikhil S. Ketkar, Lawrence B. Holder, Diane J. Coo...
DATAMINE
2006
230views more  DATAMINE 2006»
13 years 7 months ago
Mining top-K frequent itemsets from data streams
Frequent pattern mining on data streams is of interest recently. However, it is not easy for users to determine a proper frequency threshold. It is more reasonable to ask users to ...
Raymond Chi-Wing Wong, Ada Wai-Chee Fu
ICDE
2001
IEEE
141views Database» more  ICDE 2001»
14 years 9 months ago
TAR: Temporal Association Rules on Evolving Numerical Attributes
Data mining has been an area of increasing interests during recent years. The association rule discovery problem in particular has been widely studied. However, there are still so...
Wei Wang 0010, Jiong Yang, Richard R. Muntz
IACR
2011
87views more  IACR 2011»
12 years 7 months ago
Is privacy compatible with truthfulness?
In the area of privacy-preserving data mining, a differentially private mechanism intuitively encourages people to share their data truthfully because they are at little risk of ...
David Xiao