Sciweavers

5092 search results - page 366 / 1019
» Clustering the Feature Space
Sort
View
ECCV
2008
Springer
16 years 9 months ago
Quick Shift and Kernel Methods for Mode Seeking
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
Andrea Vedaldi, Stefano Soatto
ICDM
2002
IEEE
162views Data Mining» more  ICDM 2002»
16 years 17 days ago
Phrase-based Document Similarity Based on an Index Graph Model
Document clustering techniques mostly rely on single term analysis of the document data set, such as the Vector Space Model. To better capture the structure of documents, the unde...
Khaled M. Hammouda, Mohamed S. Kamel
KAIS
2006
164views more  KAIS 2006»
15 years 7 months ago
On efficiently summarizing categorical databases
Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its a...
Jianyong Wang, George Karypis
IJCM
2007
205views more  IJCM 2007»
15 years 7 months ago
BTF modelling using BRDF texels
The highest fidelity representations of realistic real-world materials currently used comprise Bidirectional Texture Functions (BTF). The BTF is a six dimensional function dependi...
Jirí Filip, Michal Haindl
ER
2005
Springer
295views Database» more  ER 2005»
16 years 1 months ago
Spatio-temporal Similarity Analysis Between Trajectories on Road Networks
Abstract. In order to analyze the behavior of moving objects, a measure for determining the similarity of trajectories needs to be defined. Although research has been conducted th...
Jung-Rae Hwang, Hye-Young Kang, Ki-Joune Li