PPT-Robust Subspace Clustering
Author : mitsue-stanley | Published Date : 2016-07-22
M Soltanolkotabi EElhamifar EJ Candes 报告 人万晟元玉慧 张 驰 昱 信息科学与技术学院 智 能科学系 1 Main Contribution Existing work Subspace
Presentation Embed Code
Download Presentation
Download Presentation The PPT/PDF document "Robust Subspace Clustering" is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.
Robust Subspace Clustering: Transcript
M Soltanolkotabi EElhamifar EJ Candes 报告 人万晟元玉慧 张 驰 昱 信息科学与技术学院 智 能科学系 1 Main Contribution Existing work Subspace Clustering. 925 520550 541450 518350 541075 518700 518350 518150 520325 518300 518375 518875 518725 524125 524250 530300 518125 524375 530175 536375 533600 530300 532025 522025 528700 520325 520325 519800 525425 525250 531350 519950 526075 531300 538075 520425 5 Moritz . Hardt. , David P. Woodruff. IBM Research . Almaden. Two Aspects of Coping with Big Data. Efficiency. Handle. enormous inputs. Robustness. Handle . adverse conditions. Big Question: Can we have both?. Brendan and Yifang . April . 21 . 2015. Pre-knowledge. We define a set A, and we find the element that minimizes the error. We can think of as a sample of . Where is the point in C closest to X. . Lecture outline. Distance/Similarity between data objects. Data objects as geometric data points. Clustering problems and algorithms . K-means. K-median. K-center. What is clustering?. A . grouping. of data objects such that the objects . W. of a vector space . V. . Recall:. Definition: . The examples we have seen so far originated from considering the span of the column vectors of a matrix . A. , or the solution set of the equation. Yining Wang. , Yu-Xiang Wang, . Aarti. Singh. Machine Learning Department. Carnegie . mellon. university. 1. Subspace Clustering. 2. Subspace Clustering Applications. Motion Trajectories tracking. 1. via Subspace Clustering. Ruizhen. Hu . Lubin. Fan . Ligang. Liu. Co-segmentation. Hu et al.. Co-Segmentation of 3D Shapes via Subspace Clustering. 2. Input. Co-segmentation. Hu et al.. Moritz . Hardt. , David P. Woodruff. IBM Research . Almaden. Two Aspects of Coping with Big Data. Efficiency. Handle. enormous inputs. Robustness. Handle . adverse conditions. Big Question: Can we have both?. A Deterministic Result. 1. st. Annual Workshop on Data Science @. Tennessee . State University. 1. Problem Definition . (. Robust Subspace Clustering). input. output. white noise. outliers. m. issing entries. What is clustering?. Why would we want to cluster?. How would you determine clusters?. How can you do this efficiently?. K-means Clustering. Strengths. Simple iterative method. User provides “K”. Unsupervised . learning. Seeks to organize data . into . “reasonable” . groups. Often based . on some similarity (or distance) measure defined over data . elements. Quantitative characterization may include. Produces a set of . nested clusters . organized as a hierarchical tree. Can be visualized as a . dendrogram. A . tree-like . diagram that records the sequences of merges or splits. Strengths of Hierarchical Clustering. Produces a set of . nested clusters . organized as a hierarchical tree. Can be visualized as a . dendrogram. A tree-like diagram that records the sequences of merges or splits. Strengths of Hierarchical Clustering. Log. 2. transformation. Row centering and normalization. Filtering. Log. 2. Transformation. Log. 2. -transformation makes sure that the noise is independent of the mean and similar differences have the same meaning along the dynamic range of the values..
Download Document
Here is the link to download the presentation.
"Robust Subspace Clustering"The content belongs to its owner. You may download and print it for personal use, without modification, and keep all copyright notices. By downloading, you agree to these terms.
Related Documents