Sciweavers

449 search results - page 34 / 90
» Latent Structure Pattern Mining
Sort
View
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
14 years 11 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...
AI
2003
Springer
14 years 4 months ago
Efficient Mining of Indirect Associations Using HI-Mine
Discovering association rules is one of the important tasks in data mining. While most of the existing algorithms are developed for efficient mining of frequent patterns, it has be...
Qian Wan, Aijun An
JIIS
2006
124views more  JIIS 2006»
13 years 11 months ago
An efficient approach to mining indirect associations
Discovering association rules is one of the important tasks in data mining. While most of the existing algorithms are developed for efficient mining of frequent patterns, it has be...
Qian Wan, Aijun An
WEBDB
2004
Springer
191views Database» more  WEBDB 2004»
14 years 4 months ago
Visualizing and Discovering Web Navigational Patterns
Web site structures are complex to analyze. Cross-referencing the web structure with navigational behaviour adds to the complexity of the analysis. However, this convoluted analys...
Jiyang Chen, Lisheng Sun, Osmar R. Zaïane, Ra...
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
14 years 11 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon