Intelligent Database Systems Lab Presenter : WU, MIN-CONG Authors : KADIM TA¸SDEMIR, PAVEL MILENOV, AND BROOKE TAPSALL 2011,IEEE Topology-Based Hierarchical.

Slides:

Advertisements

Similar presentations

GHEORGHE GRIGORAS GHEORGHE CARTINA MIHAI GAVRILAS

Advertisements

SEEM Tutorial 4 – Clustering. 2 What is Cluster Analysis?  Finding groups of objects such that the objects in a group will be similar (or.

Hierarchical Clustering

1 CSE 980: Data Mining Lecture 16: Hierarchical Clustering.

Hierarchical Clustering. Produces a set of nested clusters organized as a hierarchical tree Can be visualized as a dendrogram – A tree-like diagram that.

Hierarchical Clustering, DBSCAN The EM Algorithm

Data Mining Cluster Analysis: Basic Concepts and Algorithms

Agglomerative Hierarchical Clustering 1. Compute a distance matrix 2. Merge the two closest clusters 3. Update the distance matrix 4. Repeat Step 2 until.

Intelligent Database Systems Lab Presenter: WU, JHEN-WEI Authors: Jorge Gorricha, Victor Lobo CG Improvements on the visualization of clusters in.

Intelligent Database Systems Lab N.Y.U.S.T. I. M. local-density based spatial clustering algorithm with noise Presenter : Lin, Shu-Han Authors : Lian Duan,

BASIC METHODOLOGIES OF ANALYSIS: SUPERVISED ANALYSIS: HYPOTHESIS TESTING USING CLINICAL INFORMATION (MLL VS NO TRANS.) IDENTIFY DIFFERENTIATING GENES Basic.

Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Clustering data in an uncertain environment using an artificial.

Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology A novel document similarity measure based on earth mover’s.

© University of Minnesota Data Mining for the Discovery of Ocean Climate Indices 1 CSci 8980: Data Mining (Fall 2002) Vipin Kumar Army High Performance.

© University of Minnesota Data Mining for the Discovery of Ocean Climate Indices 1 CSci 8980: Data Mining (Fall 2002) Vipin Kumar Army High Performance.

Intelligent Database Systems Lab Presenter: NENG-KAI, HONG Authors: G. PANKAJ JAIN, VARADRAJ P. GURUPUR, JENNIFER L. SCHROEDER, AND EILEEN D. FAULKENBERRY.

Intelligent Database Systems Lab N.Y.U.S.T. I. M. Fast exact k nearest neighbors search using an orthogonal search tree Presenter : Chun-Ping Wu Authors.

Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology Unsupervised pattern recognition models for mixed feature-type.

Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology On multidimensional scaling and the embedding of self-organizing.

Intelligent Database Systems Lab Presenter: MIN-CHIEH HSIU Authors: NHAT-QUANG DOAN ∗, HANANE AZZAG, MUSTAPHA LEBBAH 2013 NN Growing self-organizing trees.

Intelligent Database Systems Lab Presenter : YAN-SHOU SIE Authors : JEROEN DE KNIJFF, FLAVIUS FRASINCAR, FREDERIK HOGENBOOM DKE Data & Knowledge.

Intelligent Database Systems Lab Presenter : WU, MIN-CONG Authors : Jorge Villalon and Rafael A. Calvo 2011, EST Concept Maps as Cognitive Visualizations.

Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 A Comparison of SOM Based Document Categorization Systems.

Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Exploiting Data Topology in Visualization and Clustering.

Clustering Algorithms k-means Hierarchic Agglomerative Clustering (HAC) …. BIRCH Association Rule Hypergraph Partitioning (ARHP) Categorical clustering.

Intelligent Database Systems Lab Presenter : Chang,Chun-Chih Authors : Miin-Shen Yang a*, Wen-Liang Hung b, De-Hua Chen a 2012, FSS Self-organizing map.

Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology Topology Preservation in Self-Organizing Feature Maps: Exact.

Technological Educational Institute Of Crete Department Of Applied Informatics and Multimedia Intelligent Systems Laboratory 1 CLUSTERS Prof. George Papadourakis,

Intelligent Database Systems Lab N.Y.U.S.T. I. M. Determining the best K for clustering transactional datasets – A coverage density-based approach Presenter.

CSE5334 DATA MINING CSE4334/5334 Data Mining, Fall 2014 Department of Computer Science and Engineering, University of Texas at Arlington Chengkai Li (Slides.

Cube Kohonen Self-Organizing Map (CKSOM) Model

Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology Exploiting Data Topology in Visualization and Clustering.

Intelligent Database Systems Lab N.Y.U.S.T. I. M. A fast nearest neighbor classifier based on self-organizing incremental neural network (SOINN) Neuron.

Intelligent Database Systems Lab Presenter : BEI-YI JIANG Authors : GUENAEL CABANES, YOUNES BENNANI, DOMINIQUE FRESNEAU ELSEVIER Improving the Quality.

Intelligent Database Systems Lab Presenter : Chang,Chun-Chih Authors : CHRISTOS BOURAS, VASSILIS TSOGKAS 2012, KBS A clustering technique for news articles.

K-Means Algorithm Each cluster is represented by the mean value of the objects in the cluster Input: set of objects (n), no of clusters (k) Output:

Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology A modified version of the K-means algorithm with a distance.

Intelligent Database Systems Lab Presenter : Kung, Chien-Hao Authors : Eghbal G. Mansoori 2011,IEEE FRBC: A Fuzzy Rule-Based Clustering Algorithm.

Intelligent Database Systems Lab Presenter : BEI-YI JIANG Authors : HAI V. PHAM, ERIC W. COOPER, THANG CAO, KATSUARI KAMEI INFORMATION SCIENCES Hybrid.

Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Model-based evaluation of clustering validation measures.

Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology Rival-Model Penalized Self-Organizing Map Yiu-ming Cheung.

Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Extending the Growing Hierarchal SOM for Clustering Documents.

Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 An initialization method to simultaneously find initial.

Intelligent Database Systems Lab N.Y.U.S.T. I. M. Validity index for clusters of different sizes and densities Presenter: Jun-Yi Wu Authors: Krista Rizman.

Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Adaptive FIR Neural Model for Centroid Learning in Self-Organizing.

Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology A new data clustering approach- Generalized cellular automata.

Intelligent Database Systems Lab Presenter : YAN-SHOU SIE Authors : MARCO PIASTRA NN Self-organizing adaptive map: Autonomous learning of curves.

Intelligent Database Systems Lab Presenter: NENG-KAI, HONG Authors: HUAN LONG A, ZIJUN ZHANG A, ⇑, YAN SU 2014, APPLIED ENERGY Analysis of daily solar.

Intelligent Database Systems Lab Presenter : WU, MIN-CONG Authors : STEPHEN T. O’ROURKE, RAFAEL A. CALVO and Danielle S. McNamara 2011, EST Visualizing.

Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Self Organizing Maps and Bit Signature: a study applied.

© Tan,Steinbach, Kumar Introduction to Data Mining 4/18/ Data Mining: Cluster Analysis This lecture node is modified based on Lecture Notes for Chapter.

Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Growing Hierarchical Tree SOM: An unsupervised neural.

Intelligent Database Systems Lab N.Y.U.S.T. I. M. Community self-Organizing Map and its Application to Data Extraction Presenter: Chun-Ping Wu Authors:

Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology Advisor : Dr. Hsu Graduate : Sheng-Hsuan Wang Author : Sanghamitra.

Intelligent Database Systems Lab Presenter : CHANG, SHIH-JIE Authors : Andrés Ortiz, Juan M. Górriz, Javier Ramírez, F.J. Martínez-Murcia 2013.PRL LVQ-SVM.

Intelligent Database Systems Lab Presenter: YU-TING LU Authors: Vittorio Carlei, Massimiliano Nuccio PRL Mapping industrial patterns in spatial agglomeration:

Intelligent Database Systems Lab Presenter : Chang,Chun-Chih Authors : Emilio Corchado, Bruno Baruque 2012 NeurCom WeVoS-ViSOM: An ensemble summarization.

Intelligent Database Systems Lab N.Y.U.S.T. I. M. Visualizing social network concepts Presenter : Chun-Ping Wu Authors :Bin Zhu, Stephanie Watts, Hsinchun.

Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology Decision trees for hierarchical multi-label classification.

Data Mining: Basic Cluster Analysis

More on Clustering in COSC 4335

A modified hyperplane clustering algorithm allows for efficient and accurate clustering of extremely large datasets Ashok Sharma, Robert Podolsky, Jieping.

Aggregation pheromone density based data clustering

CSE572, CBS598: Data Mining by H. Liu

CSE572, CBS572: Data Mining by H. Liu

Clustering The process of grouping samples so that the samples are similar within each group.

SEEM4630 Tutorial 3 – Clustering.

CSE572: Data Mining by H. Liu

Hierarchical Clustering

Presentation transcript:

Intelligent Database Systems Lab Presenter : WU, MIN-CONG Authors : KADIM TA¸SDEMIR, PAVEL MILENOV, AND BROOKE TAPSALL 2011,IEEE Topology-Based Hierarchical Clustering of Self-Organizing Maps

Intelligent Database Systems Lab Outlines Motivation Objectives Methodology Experiments Conclusions Comments

Intelligent Database Systems Lab Motivation Hierarchical clustering various distance-based similarity measures that have some flaw. 1. sensitivity to inhomogeneous within-cluster density distributions, noise or outliers. 2. depend on the cluster centroids and dispersion around these centroids.

Intelligent Database Systems Lab Objectives we employ average linkage for hierarchical clustering of prototypes based on CONN so that at each agglomeration step we merge the pair with maximum average between cluster connectivity that method CONN linkage, and add a new similarity criteria CONN_Index.

Intelligent Database Systems Lab Methodology-SOMs Adapted BMU Updating BMU RFi and RFij

Intelligent Database Systems Lab Methodology-Connectivity Martix P1P2P3 P1035 P2302 P3520 from CONN(P1,P2) = 3 CONN(P1,P3) = 5 CONN(P2,P3) = 2 CONN(P3,P2) = 2 CONN(P3,P1) = 5 CONN(P2,P1) = 3 CONN P1P2P3 P1035 P2302 P3520 CONN P1P2P3 P1013 P2201 P3210 CADJ CONN=CADJ(p1,p2)+CADJ(p2,p1) =1+2 =3

Intelligent Database Systems Lab Methodology-CONN Linkage S1S2S3S4 S10126 S21034 S32305 S46450 Similary matrix S2S3 S203 S330 Delete Add S2S3N1 S2035 S3304 N1540

Intelligent Database Systems Lab Minimum is better Maximum is better nearest 1 is better Methodology-Number of cluster

Intelligent Database Systems Lab Methodology-Applicability and Complexity of the Algorithm represent the data topology Delaunay graph is to have dense enough prototypes. occasionally CONN Linkage’s time complexity = O(p^2*d) Average Linkage’s time complexity = O(p^3*d)

Intelligent Database Systems Lab Experiment

Intelligent Database Systems Lab Experiment

Intelligent Database Systems Lab Experiment

Intelligent Database Systems Lab Experiment

Intelligent Database Systems Lab Experiment

Intelligent Database Systems Lab Experiment

Intelligent Database Systems Lab Experiment

Intelligent Database Systems Lab Conclusions CONN linkage produces partitionings better than the ones obtained by distance-based linkages. Conn_Index based on CONN graph provided better decisions than other indices in the study reported in this paper.

Intelligent Database Systems Lab Comments Advantages – CONN_Index provides the best partitioning for the preset number of clusters. – CONN linkage is mainly proposed for accurate clustering of remote sensing imagery Applications – hierarchical clustering.