Dimensionality's Blessing: Clustering Images by Underlying Distribution
暂无分享,去创建一个
Jian-Huang Lai | Yasuyuki Matsushita | Wen-Yan Lin | Siying Liu | Wen-Yan Lin | Y. Matsushita | J. Lai | Siying Liu
[1] S. P. Lloyd,et al. Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.
[2] Andrew Zisserman,et al. Three things everyone should know to improve object retrieval , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.
[3] Cordelia Schmid,et al. Aggregating local descriptors into a compact image representation , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[4] Hervé Jégou,et al. Negative Evidences and Co-occurences in Image Retrieval: The Benefit of PCA and Whitening , 2012, ECCV.
[5] Daren Yu,et al. Making the nearest neighbor meaningful for time series classification , 2011, International Congress on Image and Signal Processing.
[6] Stefano Soatto,et al. Quick Shift and Kernel Methods for Mode Seeking , 2008, ECCV.
[7] Hans-Peter Kriegel,et al. Angle-based outlier detection in high-dimensional data , 2008, KDD.
[8] Hans-Peter Kriegel,et al. A survey on unsupervised outlier detection in high‐dimensional numerical data , 2012, Stat. Anal. Data Min..
[9] Michel Verleysen,et al. The Concentration of Fractional Distances , 2007, IEEE Transactions on Knowledge and Data Engineering.
[10] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[11] Laurent Amsaleg,et al. Image retrieval with reciprocal and shared nearest neighbors , 2014, 2014 International Conference on Computer Vision Theory and Applications (VISAPP).
[12] Huan Liu,et al. Subspace clustering for high dimensional data: a review , 2004, SKDD.
[13] Ming Yang,et al. Query Specific Fusion for Image Retrieval , 2012, ECCV.
[14] Jonathan Goldstein,et al. When Is ''Nearest Neighbor'' Meaningful? , 1999, ICDT.
[15] Philip S. Yu,et al. Outlier detection for high dimensional data , 2001, SIGMOD '01.
[16] Dunja Mladenic,et al. The Role of Hubness in Clustering High-Dimensional Data , 2011, IEEE Transactions on Knowledge and Data Engineering.
[17] Antonio Torralba,et al. Modeling the Shape of the Scene: A Holistic Representation of the Spatial Envelope , 2001, International Journal of Computer Vision.
[18] D.M. Mount,et al. An Efficient k-Means Clustering Algorithm: Analysis and Implementation , 2002, IEEE Trans. Pattern Anal. Mach. Intell..
[19] Charu C. Aggarwal,et al. On the Surprising Behavior of Distance Metrics in High Dimensional Spaces , 2001, ICDT.
[20] Hans-Peter Kriegel,et al. Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering , 2009, TKDD.
[21] Pavel Berkhin,et al. A Survey of Clustering Data Mining Techniques , 2006, Grouping Multidimensional Data.
[22] Sung-Hyuk Cha. Comprehensive Survey on Distance/Similarity Measures between Probability Density Functions , 2007 .
[23] Hans-Peter Kriegel,et al. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.
[24] Alexandros Nanopoulos,et al. Reverse Nearest Neighbors in Unsupervised Distance-Based Outlier Detection , 2015, IEEE Transactions on Knowledge and Data Engineering.
[25] Avrim Blum,et al. Foundations of Data Science , 2020 .
[26] マグローヒル科学技術用語大辞典編集委員会,et al. マグローヒル科学技術用語大辞典 = McGraw-Hill dictionary of scientific and technical terms , 1979 .
[27] Michael I. Jordan,et al. On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.
[28] Pietro Perona,et al. Self-Tuning Spectral Clustering , 2004, NIPS.
[29] Simon Haykin,et al. GradientBased Learning Applied to Document Recognition , 2001 .
[30] Minh N. Do,et al. RepMatch: Robust Feature Matching and Pose for Reconstructing Modern Cities , 2016, ECCV.
[31] Pedro M. Domingos. A few useful things to know about machine learning , 2012, Commun. ACM.
[32] Yasuyuki Matsushita,et al. GMS: Grid-Based Motion Statistics for Fast, Ultra-robust Feature Correspondence , 2017, 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).
[33] Yingjie Tian,et al. A Comprehensive Survey of Clustering Algorithms , 2015, Annals of Data Science.
[34] D. Rubin,et al. Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .
[35] Philip S. Yu,et al. Fast algorithms for projected clustering , 1999, SIGMOD '99.
[36] Tomás Pajdla,et al. NetVLAD: CNN Architecture for Weakly Supervised Place Recognition , 2018, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[37] Li Fei-Fei,et al. ImageNet: A large-scale hierarchical image database , 2009, CVPR.
[38] Luc Van Gool,et al. Hello neighbor: Accurate object retrieval with k-reciprocal nearest neighbors , 2011, CVPR 2011.
[39] Radford M. Neal. Pattern Recognition and Machine Learning , 2007, Technometrics.
[40] G. Griffin,et al. Caltech-256 Object Category Dataset , 2007 .
[41] René Vidal,et al. Sparse Subspace Clustering: Algorithm, Theory, and Applications , 2012, IEEE transactions on pattern analysis and machine intelligence.
[42] Yi-Hsuan Yang,et al. ContextSeer: context search and recommendation at query time for shared consumer photos , 2008, ACM Multimedia.
[43] Sergei Vassilvitskii,et al. k-means++: the advantages of careful seeding , 2007, SODA '07.
[44] Nabil H. Mustafa,et al. k-means projective clustering , 2004, PODS.
[45] Yannis Avrithis,et al. Early burst detection for memory-efficient image retrieval , 2015, 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).
[46] Yoshua Bengio,et al. Gradient-based learning applied to document recognition , 1998, Proc. IEEE.
[47] Jitendra Malik,et al. Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.