Sciweavers

376 search results - page 42 / 76
» Efficient Indexing Structures for Mining Frequent Patterns
Sort
View
ICDE
2004
IEEE
115views Database» more  ICDE 2004»
16 years 1 months ago
Unordered Tree Mining with Applications to Phylogeny
Frequent structure mining (FSM) aims to discover and extract patterns frequently occurring in structural data, such as trees and graphs. FSM finds many applications in bioinformat...
Dennis Shasha, Jason Tsong-Li Wang, Sen Zhang
WWW
2004
ACM
16 years 13 days ago
On mining webclick streams for path traversal patterns
Mining user access patterns from a continuous stream of Web-clicks presents new challenges over traditional Web usage mining in a large static Web-click database. Modeling user ac...
Hua-Fu Li, Suh-Yin Lee, Man-Kwan Shan
81
Voted
CIKM
2006
Springer
15 years 3 months ago
A combination of trie-trees and inverted files for the indexing of set-valued attributes
Set-valued attributes frequently occur in contexts like marketbasked analysis and stock market trends. Late research literature has mainly focused on set containment joins and dat...
Manolis Terrovitis, Spyros Passas, Panos Vassiliad...
PAKDD
2007
ACM
144views Data Mining» more  PAKDD 2007»
15 years 5 months ago
Approximately Mining Recently Representative Patterns on Data Streams
Catching the recent trend of data is an important issue when mining frequent itemsets from data streams. To prevent from storing the whole transaction data within the sliding windo...
Jia-Ling Koh, Yuan-Bin Don
FQAS
2004
Springer
146views Database» more  FQAS 2004»
15 years 3 months ago
Discovering Representative Models in Large Time Series Databases
The discovery of frequently occurring patterns in a time series could be important in several application contexts. As an example, the analysis of frequent patterns in biomedical ...
Simona E. Rombo, Giorgio Terracina