Sciweavers

396 search results - page 44 / 80
» Efficient Mining of Spatiotemporal Patterns
Sort
View
ICML
2007
IEEE
15 years 10 months ago
Entire regularization paths for graph data
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda
SIGKDD
2008
125views more  SIGKDD 2008»
14 years 9 months ago
Incremental pattern discovery on streams, graphs and tensors
Incremental pattern discovery targets streaming applications where the data continuously arrive incrementally. The questions are how to find patterns (main trends) incrementally; ...
Jimeng Sun
KDD
1995
ACM
167views Data Mining» more  KDD 1995»
15 years 1 months ago
Efficient Algorithms for Attribute-Oriented Induction
Data mining or knowledge discovery in databasesis the search for relationships and global patterns that exist but are hidden in large databases.Many different methodshave been pro...
Hoi-Yee Hwang, Ada Wai-Chee Fu
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
15 years 10 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
14 years 10 months ago
GAIA: graph classification using evolutionary computation
Discriminative subgraphs are widely used to define the feature space for graph classification in large graph databases. Several scalable approaches have been proposed to mine disc...
Ning Jin, Calvin Young, Wei Wang