{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T06:10:08Z","timestamp":1736057408567,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540287926"},{"type":"electronic","value":"9783540319450"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11551898_8","type":"book-chapter","created":{"date-parts":[[2005,10,25]],"date-time":"2005-10-25T13:32:41Z","timestamp":1130247161000},"page":"63-77","source":"Crossref","is-referenced-by-count":0,"title":["An Indexing Approach for Representing Multimedia Objects in High-Dimensional Spaces Based on Expectation Maximization Algorithm"],"prefix":"10.1007","author":[{"given":"Giuseppe","family":"Boccignone","sequence":"first","affiliation":[]},{"given":"Vittorio","family":"Caggiano","sequence":"additional","affiliation":[]},{"given":"Carmine","family":"Cesarano","sequence":"additional","affiliation":[]},{"given":"Vincenzo","family":"Moscato","sequence":"additional","affiliation":[]},{"given":"Lucio","family":"Sansone","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/3-540-58094-8_18","volume-title":"Combinatorial Pattern Matching","author":"R. Baeza-Yates","year":"1994","unstructured":"Baeza-Yates, R., Cunto, W., Manber, U., Wu, S.: Proximity matching using Fixed-queries trees. In: Crochemore, M., Gusfield, D. (eds.) CPM 1994. LNCS, vol.\u00a0807, pp. 198\u2013212. Springer, Heidelberg (1994)"},{"key":"8_CR2","unstructured":"Banerjee, A., Dhillon, I.S., Ghosh, J., Sra, S.: Clustering on hyperspheres using Expectation Maximization. Technical Report TR-03-07, Department of Computer Sciences, University of Texas (February 2003)"},{"key":"8_CR3","unstructured":"Bilmes, J.A.: A Gentle Tutorial of the EM Algorithm and its Application to Parameter Estimation for Gaussian Mixture and Hidden Markov Models. Technical Report, U.C. Berkeley (April 1998)"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Boccignone, G., Chianese, A., Moscato, V., Picariello, A.: Fovaeted Shot Detection for Video Segmentation. IEEE Trans. on Circuits and Sistems for Video Technology\u00a015(3) (March 2005)","DOI":"10.1109\/TCSVT.2004.842603"},{"key":"8_CR5","unstructured":"Brin, S.: Near neighbor search in large metric spaces. In: Proc. of VLDB 1995, Switzerland, pp. 574\u2013584 (1995)"},{"issue":"4","key":"8_CR6","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1145\/362003.362025","volume":"16","author":"W.A. Burkhard","year":"1973","unstructured":"Burkhard, W.A., Keller, R.M.: Some approaches to best-match file searching. Comm. of the ACM\u00a016(4), 230\u2013236 (1973)","journal-title":"Comm. of the ACM"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0167-9473(92)90042-E","volume":"14","author":"G. Celeux","year":"1992","unstructured":"Celeux, G., Govaert, G.: A classification EM algorithm for clustering and two stochastic versions. Computational Statistics and Data Analysis\u00a014, 315\u2013332 (1992)","journal-title":"Computational Statistics and Data Analysis"},{"key":"8_CR8","unstructured":"Chavez, E., Navarro, G., Baeza-Yates, R., Marroquin, J.L.: Searching in Metric Spaces. ACM Computing Surveys (1999)"},{"key":"8_CR9","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient Access Method for Similarity Search in Metric Spaces. In: Proc. of 23rd International Conference on VLDB, pp. 426\u2013435 (1997) FQ tree 0..5825 FQ tree (with bag distance) 0.4124"},{"key":"8_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"A.P. Dempster","year":"1977","unstructured":"Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data. Journal of the Royal Statistical Society\u00a039, 1\u201338 (1977)","journal-title":"Journal of the Royal Statistical Society"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Ganti, V., Ramakrishnan, R., Gehrke, J., Powell, A., French, J.: Clustering large datasets in arbitrary metric spaces. In: The Proceedings of International Conference on Data Engineering (1999)","DOI":"10.1109\/ICDE.1999.754966"},{"key":"8_CR12","volume-title":"Algorithms for Clustering Data","author":"A.K. Jain","year":"1998","unstructured":"Jain, A.K., Dubes, R.C.: Algorithms for Clustering Data. Prentice Hall, Englewood Cliffs (1998)"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Kalantari, I., McDonald, G.: A data structure and an algorithm for the nearest point problem. IEEE Transactions on Software Engineering\u00a09(5) (1983)","DOI":"10.1109\/TSE.1983.235263"},{"key":"8_CR14","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/978-94-011-5014-9_12","volume-title":"Learning in Graphical Models","author":"R.M. Neal","year":"1998","unstructured":"Neal, R.M., Hinton, G.E.: A view of the EM algorithm that justifies incremental, sparse, and other variants. In: Jordan, M.J. (ed.) Learning in Graphical Models, pp. 355\u2013368. MIT Press, Cambridge (1998)"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"J. Uhlmann","year":"1991","unstructured":"Uhlmann, J.: Satisying general proximity\/similarity queries with metric trees. Information Processing Letters\u00a040, 175\u2013179 (1991)","journal-title":"Information Processing Letters"},{"key":"8_CR16","unstructured":"Yianilos, P.N.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, January 25-27, pp. 311\u2013321 (1993)"},{"issue":"5","key":"8_CR17","first-page":"1316","volume":"15","author":"D. Yu","year":"2003","unstructured":"Yu, D., Zhang, A.: ClusterTree: Integration of Cluster Representation and Nearest-Neighbor Search for Large Data Sets with High Dimensions. IEEE Trans. on KDE\u00a015(5), 1316\u20131330 (2003)","journal-title":"IEEE Trans. on KDE"},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1162\/jmlr.2003.4.6.1001","volume":"4","author":"S. Zhong","year":"2003","unstructured":"Zhong, S., Ghosh, J.: A Unified Framework for Model-based Clustering. Journal of Machine Learning Research\u00a04, 1001\u20131037 (2003)","journal-title":"Journal of Machine Learning Research"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Wu, J.-K.: Content-Based Indexing of Multimedia Databases. IEEE Transactions on Knowledge and Data Engineering\u00a09(6) (1997)","DOI":"10.1109\/69.649320"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Bohm, C., Berchtold, S., Keim, D.A.: Searching in High-Dimensional Spaces-Index Structures for Improving the Performance of Multimedia Databases. ACM Computing Surveys\u00a033(3) (2001)","DOI":"10.1145\/502807.502809"}],"container-title":["Lecture Notes in Computer Science","Advances in Multimedia Information Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11551898_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T05:36:49Z","timestamp":1736055409000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11551898_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540287926","9783540319450"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11551898_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}