Sciweavers

731 search results - page 35 / 147
» Taxonomy-superimposed graph mining
Sort
View
EDM
2008
113views Data Mining» more  EDM 2008»
13 years 9 months ago
Mining and Visualizing Visited Trails in Web-Based Educational Systems
A data mining and visualization tool for the discovery of student trails in web-based educational systems is presented and described. The tool uses graphs to visualize results, all...
Cristóbal Romero, Sergio Gutiérrez S...
ICDM
2008
IEEE
122views Data Mining» more  ICDM 2008»
14 years 2 months ago
Nonnegative Matrix Factorization for Combinatorial Optimization: Spectral Clustering, Graph Matching, and Clique Finding
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....
Chris H. Q. Ding, Tao Li, Michael I. Jordan
CIKM
2008
Springer
13 years 9 months ago
Structure feature selection for graph classification
With the development of highly efficient graph data collection technology in many application fields, classification of graph data emerges as an important topic in the data mining...
Hongliang Fei, Jun Huan
KDD
2006
ACM
107views Data Mining» more  KDD 2006»
14 years 8 months ago
Out-of-core frequent pattern mining on a commodity PC
In this work we focus on the problem of frequent itemset mining on large, out-of-core data sets. After presenting a characterization of existing out-of-core frequent itemset minin...
Gregory Buehrer, Srinivasan Parthasarathy, Amol Gh...
AOSD
2007
ACM
13 years 11 months ago
Efficiently mining crosscutting concerns through random walks
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Charles Zhang, Hans-Arno Jacobsen