Sciweavers

50 search results - page 9 / 10
» Using the fractal dimension to cluster datasets
Sort
View
DEXA
2006
Springer
190views Database» more  DEXA 2006»
14 years 6 days ago
High-Dimensional Similarity Search Using Data-Sensitive Space Partitioning
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
Sachin Kulkarni, Ratko Orlandic
ICMLA
2007
13 years 10 months ago
Scalable optimal linear representation for face and object recognition
Optimal Component Analysis (OCA) is a linear method for feature extraction and dimension reduction. It has been widely used in many applications such as face and object recognitio...
Yiming Wu, Xiuwen Liu, Washington Mio
ICDE
2002
IEEE
138views Database» more  ICDE 2002»
14 years 10 months ago
Efficient Temporal Join Processing Using Indices
We examine the problem of processing temporal joins in the presence of indexing schemes. Previous work on temporal joins has concentrated on non-indexed relations which were fully...
Donghui Zhang, Vassilis J. Tsotras, Bernhard Seege...
EDM
2008
289views Data Mining» more  EDM 2008»
13 years 10 months ago
Developing a Log-based Motivation Measuring Tool
The purpose of this study is to develop a conceptual framework and a tool for measuring motivation of online learners. The study was carried out in three phases, the first of which...
Arnon Hershkovitz, Rafi Nachmias
ICASSP
2011
IEEE
13 years 8 days ago
Co-clustering as multilinear decomposition with sparse latent factors
The K-means clustering problem seeks to partition the columns of a data matrix in subsets, such that columns in the same subset are ‘close’ to each other. The co-clustering pr...
Evangelos E. Papalexakis, Nicholas D. Sidiropoulos