An Indexing Approach for Representing Multimedia Objects in High-Dimensional Spaces Based on Expectation Maximization Algorithm

作者: Giuseppe Boccignone , Vittorio Caggiano , Carmine Cesarano , Vincenzo Moscato , Lucio Sansone

DOI: 10.1007/11551898_8

关键词:

摘要: In this paper we introduce a new indexing approach to representing multimedia object classes generated by the Expectation Maximization clustering algorithm in balanced and dynamic tree structure. To aim EM has been modified order obtain at each step of its recursive application clusters. manner our provides simple practical solution index clustered data support efficient retrieval nearest neighbors high dimensional spaces.

参考文章(22)
Sergey Brin, Near Neighbor Search in Large Metric Spaces very large data bases. pp. 574- 584 ,(1995)
Ricardo Baeza-Yates, Walter Cunto, Udi Manber, Sun Wu, Proximity Matching Using Fixed-Queries Trees combinatorial pattern matching. pp. 198- 212 ,(1994) , 10.1007/3-540-58094-8_18
Richard C. Dubes, Anil K. Jain, Algorithms for clustering data ,(1988)
W. A. Burkhard, R. M. Keller, Some approaches to best-match file searching Communications of the ACM. ,vol. 16, pp. 230- 236 ,(1973) , 10.1145/362003.362025
Edgar Chávez, Gonzalo Navarro, Ricardo Baeza-Yates, José Luis Marroquín, Searching in metric spaces ACM Computing Surveys. ,vol. 33, pp. 273- 321 ,(2001) , 10.1145/502807.502808
A. P. Dempster, N. M. Laird, D. B. Rubin, Maximum Likelihood from Incomplete Data Via theEMAlgorithm Journal of the Royal Statistical Society: Series B (Methodological). ,vol. 39, pp. 1- 22 ,(1977) , 10.1111/J.2517-6161.1977.TB01600.X
Jeffrey K. Uhlmann, Satisfying general proximity / similarity queries with metric trees Information Processing Letters. ,vol. 40, pp. 175- 179 ,(1991) , 10.1016/0020-0190(91)90074-R
Gilles Celeux, Gérard Govaert, A Classification EM algorithm for clustering and two stochastic versions Computational Statistics & Data Analysis. ,vol. 14, pp. 315- 332 ,(1992) , 10.1016/0167-9473(92)90042-E