Sciweavers

391 search results - page 42 / 79
» Efficient Data Mining for Path Traversal Patterns
Sort
View
AEI
2004
132views more  AEI 2004»
14 years 11 months ago
An adaptive website system to improve efficiency with web mining techniques
The paper proposes an adaptive web system--that is, a website that is capable of changing its original design to fit user requirements. For the purpose of improving shortcomings o...
Ji-Hyun Lee, Wei-Kun Shiu
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
16 years 6 days ago
Discovering significant OPSM subspace clusters in massive gene expression data
Order-preserving submatrixes (OPSMs) have been accepted as a biologically meaningful subspace cluster model, capturing the general tendency of gene expressions across a subset of ...
Byron J. Gao, Obi L. Griffith, Martin Ester, Steve...
KDD
2007
ACM
227views Data Mining» more  KDD 2007»
16 years 6 days ago
Fast best-effort pattern matching in large attributed graphs
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
Hanghang Tong, Christos Faloutsos, Brian Gallagher...
SDM
2004
SIAM
194views Data Mining» more  SDM 2004»
15 years 1 months ago
Finding Frequent Patterns in a Large Sparse Graph
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...
Michihiro Kuramochi, George Karypis
DBA
2006
182views Database» more  DBA 2006»
15 years 1 months ago
Matrix Apriori: Speeding Up the Search for Frequent Patterns
This work discusses the problem of generating association rules from a set of transactions in a relational database, taking performance and accuracy of found results as the essent...
Judith Pavón, Sidney Viana, Santiago G&oacu...