216 search results - page 12 / 44 » Using a Hash-Based Method for Apriori-Based Graph Mining |
PKDD
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. The eigenspectrum of a graph Laplacian encodes smoothness information over the graph. A natural approach to learning involves transforming the spectrum of a graph Laplaci...
INCDM
2010
Springer
13 years 7 months ago
2010
Springer
Many real world systems can be modeled as networks or graphs. Clustering algorithms that help us to organize and understand these networks are usually referred to as, graph based c...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
ICDM
2002
IEEE
14 years 1 months ago
2002
IEEE
In this paper, we present a new system, called GeneScout, for predicting gene structures in vertebrate genomic DNA. The system contains specially designed hidden Markov models (HM...
KDD
2008
ACM
14 years 9 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...