Sciweavers

732 search results - page 63 / 147
» Efficient Frequent Pattern Mining in Relational Databases
Sort
View
ICEIS
2009
IEEE
13 years 5 months ago
Mining Patterns in the Presence of Domain Knowledge
One of the main difficulties of pattern mining is to deal with items of different nature in the same itemset, which can occur in any domain except basket analysis. Indeed, if we co...
Cláudia Antunes
JIIS
2000
111views more  JIIS 2000»
13 years 7 months ago
Multidimensional Index Structures in Relational Databases
Abstract. Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on effi...
Christian Böhm, Stefan Berchtold, Hans-Peter ...
PAKDD
2004
ACM
127views Data Mining» more  PAKDD 2004»
14 years 1 months ago
Separating Structure from Interestingness
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
Taneli Mielikäinen
WWW
2004
ACM
14 years 8 months 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
PAKDD
2007
ACM
115views Data Mining» more  PAKDD 2007»
14 years 1 months ago
Intelligent Sequential Mining Via Alignment: Optimization Techniques for Very Large DB
The shear volume of the results in traditional support based frequent sequential pattern mining methods has led to increasing interest in new intelligent mining methods to find mo...
Hye-Chung Kum, Joong Hyuk Chang, Wei Wang 0010