Sciweavers

434 search results - page 64 / 87
» Dimensionality Reduction of Clustered Data Sets
Sort
View
ICDM
2007
IEEE
136views Data Mining» more  ICDM 2007»
14 years 3 months ago
Recommendation via Query Centered Random Walk on K-Partite Graph
This paper presents a recommendation algorithm that performs a query dependent random walk on a k-partite graph constructed from the various features relevant to the recommendatio...
Haibin Cheng, Pang-Ning Tan, Jon Sticklen, William...
CSDA
2006
83views more  CSDA 2006»
13 years 8 months ago
Linear grouping using orthogonal regression
A new method to detect different linear structures in a data set, called Linear Grouping Algorithm (LGA), is proposed. LGA is useful for investigating potential linear patterns in...
Stefan Van Aelst, Xiaogang Wang, Ruben H. Zamar, R...
EDBT
2004
ACM
142views Database» more  EDBT 2004»
14 years 8 months ago
Iterative Incremental Clustering of Time Series
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...
Jessica Lin, Michail Vlachos, Eamonn J. Keogh, Dim...
BIBE
2003
IEEE
116views Bioinformatics» more  BIBE 2003»
14 years 2 months ago
An Assessment of a Metric Space Database Index to Support Sequence Homology
Hierarchical metric-space clustering methods have been commonly used to organize proteomes into taxonomies. Consequently, it is often anticipated that hierarchical clustering can ...
Rui Mao, Weijia Xu, Neha Singh, Daniel P. Miranker
ICDE
2008
IEEE
124views Database» more  ICDE 2008»
14 years 10 months ago
Mining Approximate Order Preserving Clusters in the Presence of Noise
Subspace clustering has attracted great attention due to its capability of finding salient patterns in high dimensional data. Order preserving subspace clusters have been proven to...
Mengsheng Zhang, Wei Wang 0010, Jinze Liu