Sciweavers

922 search results - page 136 / 185
» A data mining approach to database compression
Sort
View
CIKM
2005
Springer
15 years 3 months ago
Compact reachability labeling for graph-structured data
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
Hao He, Haixun Wang, Jun Yang 0001, Philip S. Yu
KDD
2009
ACM
182views Data Mining» more  KDD 2009»
15 years 10 months ago
Scalable graph clustering using stochastic flows: applications to community discovery
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...
Venu Satuluri, Srinivasan Parthasarathy
ICDM
2005
IEEE
188views Data Mining» more  ICDM 2005»
15 years 3 months ago
Hierarchy-Regularized Latent Semantic Indexing
Organizing textual documents into a hierarchical taxonomy is a common practice in knowledge management. Beside textual features, the hierarchical structure of directories reflect...
Yi Huang, Kai Yu, Matthias Schubert, Shipeng Yu, V...
KDD
2005
ACM
119views Data Mining» more  KDD 2005»
15 years 3 months ago
LIPED: HMM-based life profiles for adaptive event detection
In this paper, the proposed LIPED (LIfe Profile based Event Detection) employs the concept of life profiles to predict the activeness of event for effective event detection. A gro...
Chien Chin Chen, Meng Chang Chen, Ming-Syan Chen
KDD
2010
ACM
265views Data Mining» more  KDD 2010»
15 years 1 months ago
Combining predictions for accurate recommender systems
We analyze the application of ensemble learning to recommender systems on the Netflix Prize dataset. For our analysis we use a set of diverse state-of-the-art collaborative filt...
Michael Jahrer, Andreas Töscher, Robert Legen...