Sciweavers

10 search results - page 2 / 2
» Common Spatial Pattern Discovery by Efficient Candidate Prun...
Sort
View
EDBT
2008
ACM
166views Database» more  EDBT 2008»
14 years 5 months ago
A novel spectral coding in a large graph database
Retrieving related graphs containing a query graph from a large graph database is a key issue in many graph-based applications, such as drug discovery and structural pattern recog...
Lei Zou, Lei Chen 0002, Jeffrey Xu Yu, Yansheng Lu
KDD
2006
ACM
228views Data Mining» more  KDD 2006»
14 years 5 months ago
Algorithms for time series knowledge mining
Temporal patterns composed of symbolic intervals are commonly formulated with Allen's interval relations originating in temporal reasoning. This representation has severe dis...
Fabian Mörchen
KDD
2010
ACM
270views Data Mining» more  KDD 2010»
13 years 7 months ago
An energy-efficient mobile recommender system
The increasing availability of large-scale location traces creates unprecedent opportunities to change the paradigm for knowledge discovery in transportation systems. A particular...
Yong Ge, Hui Xiong, Alexander Tuzhilin, Keli Xiao,...
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
14 years 5 months 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...
TKDE
2008
153views more  TKDE 2008»
13 years 5 months ago
Discovering Frequent Agreement Subtrees from Phylogenetic Data
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
Sen Zhang, Jason Tsong-Li Wang