502 search results - page 37 / 101 » Knowledge discovery from data streams |
KDD
2008
ACM
15 years 10 months ago
2008
ACM
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...
103
click to vote
RSCTC
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. Institutional databases can be instrumental in understanding a business process, but additional data may broaden the empirical perspective on the investigated process. We...
ALT
2002
Springer
15 years 7 months ago
2002
Springer
Abstract. The explosion of data stored in commercial or administrational databases calls for intelligent techniques to discover the patterns hidden in them and thus to exploit all ...
AUSDM
2007
Springer
15 years 4 months ago
2007
Springer
Educators developing data mining courses face a difficult task of designing curricula that are adaptable, have solid foundations, and are tailored to students from different acade...
KDD
2004
ACM
15 years 10 months ago
2004
ACM
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...