Clustering With Constraints Feasibility Issues and the k-Means Algorithm 報告者：林俞均日期： 2014/8/27.

Slides:

Advertisements

Similar presentations

Blind motion deblurring from a single image using sparse approximation

Advertisements

作者:Soo-Chang Pei, Io-Kuong Tam

The UNIVERSITY of Kansas EECS 800 Research Seminar Mining Biological Data Instructor: Luke Huan Fall, 2006.

Piyu Tsia,Yu-Chen Hu,Hsiu-Lien Yen Signal Processing 日期 :1 月 4 號報告者 : 許睿中.

Machine learning optimization

A Probabilistic Framework for Semi-Supervised Clustering

Using quad smoothness to efficiently control capacity–distortion of reversible data hiding Chi-Nan Lin, Daniel J. Buehrer, Chin-Chen Chang, Tzu-Chuen Lu.

A Secure Remote User Authentication Scheme with Smart Cards Manoj Kumar 報告者 : 許睿中日期 :

1 Abstract This paper presents a novel modification to the classical Competitive Learning (CL) by adding a dynamic branching mechanism to neural networks.

Unsupervised Learning: Clustering Some material adapted from slides by Andrew Moore, CMU. Visit for

Support Vector Machines Formulation  Solve the quadratic program for some : min s. t.,, denotes where or membership.  Different error functions and measures.

Parallel-Search Trie-based Scheme for Fast IP Lookup

2015/6/201 Minimum Spanning Tree Partitioning Algorithm for Microaggregation 報告者：林惠珍.

Semi-Supervised Clustering Jieping Ye Department of Computer Science and Engineering Arizona State University

1 Context-Aware Clustering Junsong Yuan and Ying Wu EECS Dept., Northwestern University.

Handling Constraints 報告者 : 王敬育. Many researchers investigated Gas based on floating point representation but the optimization problems they considered.

Dg.o conference 2006 Near-Duplicate Detection for eRulemaking Hui Yang, Jamie Callan Language Technologies Institute School of Computer Science Carnegie.

Proceedings of the 2007 SIAM International Conference on Data Mining.

On G-network and resource allocation in multimedia systems 報告者 : 王敬育.

Duyu Tang, Furu Wei, Nan Yang, Ming Zhou, Ting Liu, Bing Qin

Near-Duplicate Detection by Instance-level Constrained Clustering Hui Yang, Jamie Callan Language Technologies Institute School of Computer Science Carnegie.

Clustering & Dimensionality Reduction 273A Intro Machine Learning.

Relaxed Transfer of Different Classes via Spectral Partition Xiaoxiao Shi 1 Wei Fan 2 Qiang Yang 3 Jiangtao Ren 4 1 University of Illinois at Chicago 2.

Ontology Learning and Population from Text: Algorithms, Evaluation and Applications Chapters Presented by Sole.

Evaluating Performance for Data Mining Techniques

CSC 4510 – Machine Learning Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova University Course website:

Harmonically Informed Multi-pitch Tracking Zhiyao Duan, Jinyu Han and Bryan Pardo EECS Dept., Northwestern Univ. Interactive Audio Lab,

7.1 The Software Engineering Discipline 7.2 The Software Life Cycle 報告者 : 林建任.

Extracting Barcodes from a Camera-Shaken Image on Camera Phones Graduate Institute of Communication Engineering National Taiwan University Chung-Hua Chu,

Classification and Ranking Approaches to Discriminative Language Modeling for ASR Erinç Dikici, Murat Semerci, Murat Saraçlar, Ethem Alpaydın 報告者：郝柏翰 2013/01/28.

Combined Central and Subspace Clustering for Computer Vision Applications Le Lu 1 René Vidal 2 1 Computer Science Department, Johns Hopkins University,

START OF DAY 8 Reading: Chap. 14. Midterm Go over questions General issues only Specific issues: visit with me Regrading may make your grade go up OR.

Clustering Methods K- means. K-means Algorithm Assume that K=3 and initially the points are assigned to clusters as follows. C 1 ={x 1,x 2,x 3 }, C 2.

MARISSA: MApReduce Implementation for Streaming Science Applications 作者 : Fadika, Z. ; Hartog, J. ; Govindaraju, M. ; Ramakrishnan, L. ; Gunter, D. ; Canon,

Apache Mahout. Mahout Introduction Machine Learning Clustering K-means Canopy Clustering Fuzzy K-Means Conclusion.

Efficient Estimation of Word Representations in Vector Space

Low-Rank Kernel Learning with Bregman Matrix Divergences Brian Kulis, Matyas A. Sustik and Inderjit S. Dhillon Journal of Machine Learning Research 10.

Breast Cancer Diagnosis via Neural Network Classification Jing Jiang May 10, 2000.

Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.

Song-level Multi-pitch Tracking by Heavily Constrained Clustering Zhiyao Duan, Jinyu Han and Bryan Pardo EECS Dept., Northwestern Univ. Interactive Audio.

Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology A k-mean clustering algorithm for mixed numeric and categorical.

Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.

Reversible Date Hiding Based on Histogram Modification of pixel Differences IEEE Transactions on circuits and systems for video technology, VOL. 19, NO.

Theoretical study of skin effect on multilevel slug tests in highly permeable aquifer 指導教授 : 陳家洵老師報告者 : 謝頤祥報告日期 :

Neural Text Categorizer for Exclusive Text Categorization Journal of Information Processing Systems, Vol.4, No.2, June 2008 Taeho Jo* 報告者 : 林昱志.

A Practical Web-based Approach to Generating Topic Hierarchy for Text Segments CIKM2004 Speaker ： Yao-Min Huang Date ： 2005/03/10.

Clustering Clustering is a technique for finding similarity groups in data, called clusters. I.e., it groups data instances that are similar to (near)

Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology Enhanced neural gas network for prototype-based clustering.

Compiled By: Raj Gaurang Tiwari Assistant Professor SRMGPC, Lucknow Unsupervised Learning.

KNN & Naïve Bayes Hongning Wang Today’s lecture Instance-based classifiers – k nearest neighbors – Non-parametric learning algorithm Model-based.

Other Map-Reduce (ish) Frameworks: Spark William Cohen 1.

Image Size Invariant Visual Cryptography for General Access Structures Subject to Display Quality Constraints 報告者 : 陳建宇.

Gradient Methods In Optimization

Decision Trees for Mining Data Streams Based on the Gaussian Approximation Leszek Rutkowski, Fellow, IEEE, Maciej Jaworski, Lena Pietruczuk, and Piotr.

M M M M 5. Not Listed

A Case for End System Multicast 學號：報告人：通訊所吳瑞益指導教授：楊峻權日期： ACM SIGMETRICS.

Cluster Analysis Data Mining Experiment Department of Computer Science Shenzhen Graduate School Harbin Institute of Technology.

Time Remaining 20:00.

Scalable Learning of Collective Behavior Based on Sparse Social Dimensions Lei Tang, Huan Liu CIKM ’ 09 Speaker: Hsin-Lan, Wang Date: 2010/02/01.

南台科技大學資訊工程系 An effective solution for trademark image retrieval by combining shape description and feature matching 指導教授：李育強報告者：楊智雁日期： 2010/08/27.

Given a set of data points as input Randomly assign each point to one of the k clusters Repeat until convergence – Calculate model of each of the k clusters.

KNN & Naïve Bayes Hongning Wang

Document Clustering with Prior Knowledge Xiang Ji et al. Document Clustering with Prior Knowledge. SIGIR 2006 Presenter: Suhan Yu.

Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.

The Report of Monographic Study

Each hotel guest has a set of keys and no two guests have the same key

指導教授：Chen, Ming-puu 報告者：Chen, Wan-Yi 報告日期：

Types of Errors And Error Analysis.

Presentation transcript:

Clustering With Constraints Feasibility Issues and the k-Means Algorithm 報告者：林俞均日期： 2014/8/27

Abstract the CVQE(Constrained Vector Quantization Error) algorithm was proposed in this context It modifies the objective function of traditional K-means CVQE was shown to efficiently produce high- quality clustering of UCI data.

Constrained K-means Algorithm Must-link and cannot-link Must-link(ML): constraints specify that two instances have to be in the same cluster Cannot-link(CL): constraints specify that two instances must not be placed in the same cluster

The CVQE Algorithm k-means algorithm CVQE algorithm

The remaining terms are the errors associated with the must-link (ml=1) and cannot-link (ml=0) constraints. We use ¬ to denote the negation of the Delta function.