On the effective clustering of multidimensional data sequences

In this paper, we investigate the problem of clustering multidimensional data sequences such as video streams. Each sequence is represented by a small number of hyper-rectangular clusters for subsequent indexing and similarity search processing. We present a linear clustering algorithm that guarantees the predefined level of clustering quality, and show its effectiveness via experiments on various video data sets. (C) 2001 Elsevier Science B.V. All rights reserved.
Publisher
ELSEVIER SCIENCE BV
Issue Date
2001-10
Language
ENG
Citation

INFORMATION PROCESSING LETTERS, v.80, no.2, pp.87 - 95

ISSN
0020-0190
URI
http://hdl.handle.net/10203/1621
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
CS-TR-2000-154.pdf(136.44 kB)Download
  • Hit : 818
  • Download : 288
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 1 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0