Representative Selection in Nonmetric Datasets

REFERENCES

• Azran, A., and Z. Ghahramani. 2006. A new approach to data driven clustering. In Proceedings of the 23rd international conference on machine learning, 57–64. Pittsburgh, PA: ACM.
   Google Scholar
• Bergstra, J., N. Casagrande, D. Erhan, D. Eck, and B. Kégl. 2006. Aggregate features and ADABOOST for music classification. Machine Learning 65 (2–3):473–84. doi:10.1007/s10994-006-9019-7.
   Web of Science ®Google Scholar
• Billings, D., D. Papp, J. Schaeffer, and D. Szafron. 1998. Opponent modeling in poker. Proceedings of the National Conference on Artificial Intelligence, 493–99. July 26–30, 1998, Madison, WI.
   Google Scholar
• Carmel, D., and S. Markovitch. 1996. Opponent modeling in multi-agent systems. In Adaption and learning in multi-agent systems, 40–52. Berlin Heidelberg: Springer.
   Google Scholar
• Casey, M. A., R. Veltkamp, M. Goto, M. Leman, C. Rhodes, and M. Slaney. 2008. Content-based music information retrieval: Current directions and future challenges. Proceedings of the IEEE 96 (4):668–96. doi:10.1109/JPROC.2008.916370.
   Web of Science ®Google Scholar
• Chen, W.-Y., Y. Song, H. Bai, C.-J. Lin, and E. Y. Chang. 2011. Parallel spectral clustering in distributed systems. IEEE Transactions on Pattern Analysis and Machine Intelligence 33 (3):568–86. doi:10.1109/TPAMI.2010.88.
   PubMed Web of Science ®Google Scholar
• Chu, W.-T., and C.-H. Lin. 2008. Automatic selection of representative photo and smart thumbnailing using near-duplicate detection. In Proceedings of the 16th ACM international conference on multimedia, 829–32. New York, NY: ACM.
   Google Scholar
• Clarke, E. and N. Cook. (eds.). 2004. Computational and comparative musicology. In Empirical musicology: Aims, methods, prospects, 103–26. Oxford: Oxford University Press.
   Google Scholar
• Cuthbert, M. S., and C. Ariza. 2010. Music21: A toolkit for computer-aided musicology and symbolic music data. International Society for Music Information Retrieval Conference (ISMIR 2010). Utrecht, The Netherlands.
   Google Scholar
• Davis, J. V., B. Kulis, P. Jain, S. Sra, and I. S. Dhillon. 2007. Information-theoretic metric learning. In Proceedings of the 24th international conference on machine learning, 209–16. New York, NY: ACM.
   Google Scholar
• De Francesca, F., G. Gordano, R. Ortale, and A. Tagarelli. 2003. Distance-based clustering of xml documents. ECML/PKDD 3:75–78.
   Google Scholar
• Dubnov, S., G. Assayag, O. Lartillot, and G. Bejerano. 2003. Using machine-learning methods for musical style modeling. Computer 36 (10):73–80. doi:10.1109/MC.2003.1236474.
   Web of Science ®Google Scholar
• Eick, C. F., N. Zeidat, and R. Vilalta. 2004. Using representative-based clustering for nearest neighbor dataset editing. Fourth IEEE International Conference on Data Mining, 2004. ICDM’04, 375–78. IEEE. November 1–4, 2004, Brighton, UK.
   Google Scholar
• Elhamifar, E., G. Sapiro, and R. Vidal. 2012. Finding exemplars from pairwise dissimilarities via simultaneous sparse recovery. In Proceedings of Advances in neural information processing systems, 19–27. December 3–8, 2012, Harrahs and Harveys, Lake Tahoe, CA.
   Google Scholar
• Garey, M. R., and D. S. Johnson. 1979. Computers and intractability: A guide to the theory of np-completeness. San Francisco, CA: WH Freeman & Co.
   Google Scholar
• Gonzalez, T. F. 1985. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science 38:293–306. doi:10.1016/0304-3975(85)90224-5.
   Web of Science ®Google Scholar
• Hadi, Y., F. Essannouni, and R. O. H. Thami. 2006. Video summarization by k-medoid clustering. In Proceedings of the 2006 ACM symposium on applied computing, 1400–01. New York, NY: ACM.
   Google Scholar
• Hochbaum, D. S., and D. B. Shmoys. 1985. A best possible heuristic for the k-center problem. Mathematics of Operations Research 10 (2):180–84. doi:10.1287/moor.10.2.180.
   Web of Science ®Google Scholar
• Hochbaum, D. S., and D. B. Shmoys. 1986. A unified approach to approximation algorithms for bottleneck problems. Journal of the ACM (JACM) 33 (3):533–50. doi:10.1145/5925.5933.
   Web of Science ®Google Scholar
• Jain, A. K., M. N. Murty, and P. J. Flynn. 1999. Data clustering: A review. ACM Computing Surveys (CSUR) 31 (3):264–323. doi:10.1145/331499.331504.
   Web of Science ®Google Scholar
• Karp, R. M. 1972. Reducibility among combinatorial problems. Springer US.
   Google Scholar
• Kaufman, L. and P. J. Rousseeuw. 1990. Finding groups in data: An introduction to cluster analysis. New York, NY: John Wiley & Sons.
   Google Scholar
• Kitano, H. et al. 1998. The robocup synthetic agent challenge 97. RoboCup-97: Robot Soccer World Cup I, 62–73. Berlin Heidelberg: Springer.
   Google Scholar
• Lamere, P. 2008. Social tagging and music information retrieval. Journal of New Music Research 37 (2):101–14. doi:10.1080/09298210802479284.
   Web of Science ®Google Scholar
• MacQueen, J., et al. 1967. Some methods for classification and analysis of multivariate observations. Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, vol. 1, 14. California, USA.
   Google Scholar
• Mani, I., and M. T. Maybury. 1999. Advances in automatic text summarization. Cambridge, MA: MIT press.
   Google Scholar
• Mayol, W. W., and D. W. Murray. 2005. Wearable hand activity recognition for event summarization. Proceedings of the Ninth IEEE International Symposium on Wearable Computers, 2005, 122–29. Osaka, Japan: IEEE.
   Google Scholar
• Needleman, S. B., and C. D. Wunsch. 1970. A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology 48 (3):443–53. doi:10.1016/0022-2836(70)90057-4.
   PubMed Web of Science ®Google Scholar
• Nenkova, A., and K. McKeown. 2012. A survey of text summarization techniques. In Mining Text Data, eds. C. C. Aggarwal and C. Zhai, 43–76. Springer US.
   Google Scholar
• Pearce, M. T., D. Müllensiefen, and G. A. Wiggins. 2008. A comparison of statistical and rule-based models of melodic segmentation. Proceedings of the Ninth International Conference on Music Information Retrieval, 89–94. Philadelphia, PA.
   Google Scholar
• Raz, R., and S. Safra. 1997. A sub-constant error-probability low-degree test, and a sub-constant error-probability pcp characterization of np. In Proceedings of the twenty-ninth annual ACM symposium on theory of computing, 475–84. New York, NY: ACM.
   Google Scholar
• Saitou, N., and M. Nei. 1987. The neighbor-joining method: A new method for reconstructing phylogenetic trees. Molecular Biology and Evolution 4 (4):406–25.
   PubMed Web of Science ®Google Scholar
• Shi, J., and J. Malik. 2000. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 22 (8):888–905. doi:10.1109/34.868688.
   Web of Science ®Google Scholar
• Shu, L., A. Chen, M. Xiong, and W. Meng. 2011. Efficient spectral neighborhood blocking for entity resolution. In 2011 IEEE 27th international conference on data engineering (ICDE), 1067–78. IEEE.
   Google Scholar
• Sibson, R. 1973. Slink: An optimally efficient algorithm for the single-link cluster method. The Computer Journal 16 (1):30–34. doi:10.1093/comjnl/16.1.30.
   Web of Science ®Google Scholar
• Smith, T. F., and M. S. Waterman. 1981. Identification of common molecular subsequences. Journal of Molecular Biology 147 (1):195–97 . doi:10.1016/0022-2836(81)90087-5.
   PubMed Web of Science ®Google Scholar
• Tambe, M. 1995. Recursive Agent and Agent-Group Tracking in a Real-Time Dynamic Environment. Proceedings of the First International Conference on Multiagent Systems, June 12–14, 1995, San Francisco, California, USA.
   Google Scholar
• Von Luxburg, U. 2007. A tutorial on spectral clustering. Statistics and Computing 17 (4):395–416. doi:10.1007/s11222-007-9033-z.
   Web of Science ®Google Scholar
• Wang, Y., S. Tang, F. Liang, Y. Zhang, and J. Li. 2013. Beyond kmedoids: Sparse model based medoids algorithm for representative selection. In Advances in multimedia modeling, 239–50. Berlin Heidelberg: Springer.
   Google Scholar
• Xing, E. P., A. Y. Ng, M. I. Jordan, and S. Russell. 2002. Distance metric learning, with application to clustering with side-information. Advances in Neural Information Processing Systems 15:505–12.
   Google Scholar
• Xu, R., and D. Wunsch. 2005. Survey of clustering algorithms. IEEE Transactions on Neural Networks 16 (3):645–78. doi:10.1109/TNN.2005.845141.
   PubMed Web of Science ®Google Scholar
• Yuan, J., Y. Wu, and M. Yang. 2007. Discovery of collocation patterns: From visual words to visual phrases. In IEEE conference on computer vision and pattern recognition, 2007. CVPR’07, 1–8. IEEE.
   Google Scholar
• Zhang, T. 2002. Covering number bounds of certain regularized linear function classes. The Journal of Machine Learning Research 2:527–50.
   Web of Science ®Google Scholar