376 search results - page 44 / 76 » Efficient Indexing Structures for Mining Frequent Patterns |
WEBI
2005
Springer
15 years 5 months ago
2005
Springer
Over the last years, we have witnessed an explosive growth of e-learning. More and more learning contents have been published and shared over the Internet. Therefore, how to progr...
KDD
2003
ACM
16 years 5 days ago
2003
ACM
High-dimensional data poses a severe challenge for data mining. Feature selection is a frequently used technique in preprocessing high-dimensional data for successful data mining....
187
click to vote
GIS
2004
ACM
16 years 24 days ago
2004
ACM
Spatial co-location patterns represent the subsets of events whose instances are frequently located together in geographic space. We identified the computational bottleneck in the...
KDD
2006
ACM
16 years 5 days 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...
KDD
2006
ACM
16 years 5 days ago
2006
ACM
We study the mining of interesting patterns in the presence of numerical attributes. Instead of the usual discretization methods, we propose the use of rank based measures to scor...