376 search results - page 32 / 76 » Efficient Indexing Structures for Mining Frequent Patterns |
LREC
2008
15 years 1 months ago
2008
Being the client's first interface, call centres worldwide contain a huge amount of information of all kind under the form of conversational speech. If accessible, this infor...
118
click to vote
INFOSCALE
2007
ACM
15 years 1 months ago
2007
ACM
Large-scale Parallel Web Search Engines (WSEs) needs to adopt a strategy for partitioning the inverted index among a set of parallel server nodes. In this paper we are interested ...
KDD
2003
ACM
16 years 5 days ago
2003
ACM
Although most time-series data mining research has concentrated on providing solutions for a single distance function, in this work we motivate the need for a single index structu...
106
click to vote
KDD
2002
ACM
16 years 5 days ago
2002
ACM
We introduce a new algorithm for mining sequential patterns. Our algorithm is especially efficient when the sequential patterns in the database are very long. We introduce a novel...
CIB
2004
14 years 11 months ago
2004
In multi-database mining, there can be many local patterns (frequent itemsets or association rules) in each database. At the end of multi-database mining, it is necessary to analyz...