Sciweavers

1244 search results - page 105 / 249
» Cluster Based Personalized Search
Sort
View
142
Voted
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
15 years 1 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...
117
Voted
BMCBI
2006
97views more  BMCBI 2006»
15 years 3 months ago
REEF: searching REgionally Enriched Features in genomes
Background: In Eukaryotic genomes, different features including genes are not uniformly distributed. The integration of annotation information and genomic position of functional D...
Alessandro Coppe, Gian Antonio Danieli, Stefania B...
230
Voted
ISNN
2011
Springer
14 years 6 months ago
Orthogonal Feature Learning for Time Series Clustering
This paper presents a new method that uses orthogonalized features for time series clustering and classification. To cluster or classify time series data, either original data or...
Xiaozhe Wang, Leo Lopes
133
Voted
ICDM
2003
IEEE
134views Data Mining» more  ICDM 2003»
15 years 9 months ago
Probabilistic User Behavior Models
We present a mixture model based approach for learning individualized behavior models for the Web users. We investigate the use of maximum entropy and Markov mixture models for ge...
Eren Manavoglu, Dmitry Pavlov, C. Lee Giles
167
Voted
DASFAA
2008
IEEE
190views Database» more  DASFAA 2008»
15 years 10 months ago
Analysis of Time Series Using Compact Model-Based Descriptions
Abstract. Recently, we have proposed a novel method for the compression of time series based on mathematical models that explore dependencies between different time series. This r...
Hans-Peter Kriegel, Peer Kröger, Alexey Pryak...