Research Topics Dr. Bernard Chen Ph.D. University of Central Arkansas Fall 2009.

Slides:



Advertisements
Similar presentations
Clustering Overview Algorithm Begin with all sequences in one cluster While splitting some cluster improves the objective function: { Split each cluster.
Advertisements

Data Mining (Apriori Algorithm)DCS 802, Spring DCS 802 Data Mining Apriori Algorithm Spring of 2002 Prof. Sung-Hyuk Cha School of Computer Science.
Ch2 Data Preprocessing part3 Dr. Bernard Chen Ph.D. University of Central Arkansas Fall 2009.
10 -1 Lecture 10 Association Rules Mining Topics –Basics –Mining Frequent Patterns –Mining Frequent Sequential Patterns –Applications.
Clustering V. Outline Validating clustering results Randomization tests.
Clustering and Research Works Dr. Bernard Chen Ph.D. University of Central Arkansas.
Data Mining Techniques Cluster Analysis Induction Neural Networks OLAP Data Visualization.
Data Mining Techniques So Far: Cluster analysis K-means Classification Decision Trees J48 (C4.5) Rule-based classification JRIP (RIPPER) Logistic Regression.
Introduction BNFO 602 Usman Roshan. Course grade Project: –Find a bioinformatics topic by Feb 5th. This can be a paper or a research question you wish.
By Fernando Seoane, April 25 th, 2006 Demo for Non-Parametric Classification Euclidean Metric Classifier with Data Clustering.
Prénom Nom Document Analysis: Data Analysis and Clustering Prof. Rolf Ingold, University of Fribourg Master course, spring semester 2008.
Summarization of Frequent Pattern Mining. What is FPM? Why being frequent is so important? Application of FPM Decision make/Business Software Debugging.
Protein Homology Discovery Mixed bag of proteins Protein Homologies PHD Genes Database Open reading frame finder Proteins Database BLAST Clustering Protein.
Research Project Mining Negative Rules in Large Databases using GRD.
APPLICATION OF K-MEANS CLUSTERING The Matlab function “kmeans()” was used for clustering The parameters to the function were : 1. The matrix of entire.
Parallel K-Means Clustering Based on MapReduce The Key Laboratory of Intelligent Information Processing, Chinese Academy of Sciences Weizhong Zhao, Huifang.
1 Synthesizing High-Frequency Rules from Different Data Sources Xindong Wu and Shichao Zhang IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL.
Lecture 09 Clustering-based Learning
Presented by Liu Qi An introduction to Bioinformatics Algorithms Qi Liu
CHURN PREDICTION MODEL IN RETAIL BANKING USING FUZZY C- MEANS CLUSTERING Džulijana Popović Consumer Finance, Zagrebačka banka d.d. Consumer Finance, Zagrebačka.
Clustering Algorithms Mu-Yu Lu. What is Clustering? Clustering can be considered the most important unsupervised learning problem; so, as every other.
Chapter 5 Mining Association Rules with FP Tree Dr. Bernard Chen Ph.D. University of Central Arkansas Fall 2010.
Minimum Spanning Tree Dr. Bernard Chen Ph.D. University of Central Arkansas Fall 2008.
How to make a presentation (Oral and Poster) Dr. Bernard Chen Ph.D. University of Central Arkansas July 5 th Applied Research in Healthy Information.
CS525: Big Data Analytics Machine Learning on Hadoop Fall 2013 Elke A. Rundensteiner 1.
Probability-based imputation method for fuzzy cluster analysis of gene expression microarray data Thanh Le, Tom Altman and Katheleen Gardiner University.
WMU CS6260 Parallel Computations II Spring 2013 Presentation #2 Professor: Dr. de Doncker Name: Xuanyu Hu March/11/2013.
Protein Local 3D Structure Prediction by Super Granule Support Vector Machines (Super GSVM) Dr. Bernard Chen Assistant Professor Department of Computer.
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.
My Research Work and Clustering Dr. Bernard Chen Ph.D. University of Central Arkansas Fall 2010.
Introduction to Bioinformatics Biostatistics & Medical Informatics 576 Computer Sciences 576 Fall 2008 Colin Dewey Dept. of Biostatistics & Medical Informatics.
Implementation of “A New Two-Phase Sampling Based Algorithm for Discovering Association Rules” Tokunbo Makanju Adan Cosgaya Faculty of Computer Science.
Fast Algorithms for Mining Association Rules Rakesh Agrawal and Ramakrishnan Srikant VLDB '94 presented by kurt partridge cse 590db oct 4, 1999.
Positional Association Rules Dr. Bernard Chen Ph.D. University of Central Arkansas.
CONFIDENTIAL1 Hidden Decision Trees to Design Predictive Scores – Application to Fraud Detection Vincent Granville, Ph.D. AnalyticBridge October 27, 2009.
Christoph F. Eick Questions and Topics Review November 11, Discussion of Midterm Exam 2.Assume an association rule if smoke then cancer has a confidence.
An efficient hybrid clustering algorithm for molecular sequences classification Wei-Bang Chen.
An Overview of Clustering Methods Michael D. Kane, Ph.D.
I. Problem  Improve large-scale retrieval / classification accuracy  Incorporate spatial relationship between the features in the image  Oxford 5K Dataset.
EB3233 Bioinformatics Introduction to Bioinformatics.
Ch. Eick: Introduction to Hierarchical Clustering and DBSCAN 1 Remaining Lectures in Advanced Clustering and Outlier Detection 2.Advanced Classification.
Summary „Data mining” Vietnam national university in Hanoi, College of technology, Feb.2006.
PART 10 Pattern Recognition 1. Fuzzy clustering 2. Fuzzy pattern recognition 3. Fuzzy image processing FUZZY SETS AND FUZZY LOGIC Theory and Applications.
A new initialization method for Fuzzy C-Means using Fuzzy Subtractive Clustering Thanh Le, Tom Altman University of Colorado Denver July 19, 2011.
About Me Swaroop Butala  MSCS – graduating in Dec 09  Specialization: Systems and Databases  Interests:  Learning new technologies  Application of.
Clustering Patrice Koehl Department of Biological Sciences National University of Singapore
Date: 2011/1/11 Advisor: Dr. Koh. Jia-Ling Speaker: Lin, Yi-Jhen Mr. KNN: Soft Relevance for Multi-label Classification (CIKM’10) 1.
Molecular Classification of Cancer: Class Discovery and Class Prediction by Gene Expression Monitoring T.R. Golub et al., Science 286, 531 (1999)
Determine the sequence of genes along a chromosome based on the following recombination frequencies A-C 20% A-D 10% B-C 15% B-D 5%
Cluster Analysis Data Mining Experiment Department of Computer Science Shenzhen Graduate School Harbin Institute of Technology.
1 Pattern Recognition: Statistical and Neural Lonnie C. Ludeman Lecture 28 Nov 9, 2005 Nanjing University of Science & Technology.
Clustering Algorithms Sunida Ratanothayanon. What is Clustering?
An Energy-Efficient Approach for Real-Time Tracking of Moving Objects in Multi-Level Sensor Networks Vincent S. Tseng, Eric H. C. Lu, & Kawuu W. Lin Institute.
Cluster Analysis Dr. Bernard Chen Ph.D. Assistant Professor Department of Computer Science University of Central Arkansas Fall 2010.
Mining Tag Semantics for Social Tag Recommendation Hsin-Chang Yang Department of Information Management National University of Kaohsiung.
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.
Fuzzy C-means Clustering Dr. Bernard Chen University of Central Arkansas.
1 Computational Approaches(1/7)  Computational methods can be divided into four categories: prediction methods based on  (i) The overall protein amino.
Sparse nonnegative matrix factorization for protein sequence motifs information discovery Presented by Wooyoung Kim Computer Science, Georgia State University.
南亚和印度.
CLUSTERING EE Class Presentation. TOPICS  Clustering basic and types  K-means, a type of Unsupervised clustering  Supervised clustering type.
BNFO 615 Fall 2016 Usman Roshan NJIT. Outline Machine learning for bioinformatics – Basic machine learning algorithms – Applications to bioinformatics.
Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2012
Chapter 6 Classification and Prediction
RESEARCH APPROACH.
Data Mining and Its Applications to Image Processing
University of Ljubljana – Slovenia Faculty of electrical engineering
KMeans Clustering on Hadoop Fall 2013 Elke A. Rundensteiner
Sequences Example Continue the following sequences for the next two terms 1, 2, 3, 4, 5, ……… 2, 4, 6, 8, 10, ………… 1, 3, 5, 7, 9, ………….. 4, 8, 12, 16, ………….
Presentation transcript:

Research Topics Dr. Bernard Chen Ph.D. University of Central Arkansas Fall 2009

Research Topics Clustering-- Fuzzy-HKmeans clustering model for protein sequence motif discovery Using Biclustering algorithm to improve clustering results Association Rules – Super-rules clustering by positional association rule Positional Association Super-Rule with different mapping mechanism Classification -- Protein local 3D structure prediction incorporate with Chou-Fasman parameter

Future Works

Granular Computing Model Original dataset Fuzzy C-Means Clustering Informatio n Granule 1 Informatio n Granule M K-means Clustering K-means Clustering Join Information Final Sequence Motifs Information...

Hybrid Hierarchical K-means (HHK) clustering algorithm Number of cluster: 0

Hybrid Hierarchical K-means (HHK) clustering algorithm Number of cluster: 1

Hybrid Hierarchical K-means (HHK) clustering algorithm Number of cluster: 2

Hybrid Hierarchical K-means (HHK) clustering algorithm Number of cluster: 3

Hybrid Hierarchical K-means (HHK) clustering algorithm Number of cluster: 3

Hybrid Hierarchical K-means (HHK) clustering algorithm Number of cluster: 2

Hybrid Hierarchical K-means (HHK) clustering algorithm

Number of cluster: 3

Research Topics Clustering-- Fuzzy-HKmeans clustering model for protein sequence motif discovery Using Biclustering algorithm to improve clustering results Association Rules – Super-rules clustering by positional association rule Positional Association Super-Rule with different mapping mechanism Classification -- Protein local 3D structure prediction incorporate with Chou-Fasman parameter

Future Works

Research Topics Clustering-- Fuzzy-HKmeans clustering model for protein sequence motif discovery Using Biclustering algorithm to improve clustering results Association Rules – Super-rules clustering by positional association rule Positional Association Super-Rule with different mapping mechanism Classification -- Protein local 3D structure prediction incorporate with Chou-Fasman parameter

Future Works

Positional Association Rules

Positional Association Rules Example

Positional Association Rules D=>B minimum distance assurance = 60% 1. = 3/4 3.=1/4 2.= 1/4

Positional Association Rules B=>D minimum distance assurance = 60% 1. = 3/63. = 1/6 2.= 1/6

Positional Association Rules A=>B minimum distance assurance = 60% 1. = 2/43. = 1/4 2.= 1/4 4. = 1/4

Positional Association Rules A=>D minimum distance assurance = 60% 1. = 3/4 2.= 1/4

Positional Association Rules 2-itemset Positional Association Rules:

Research Topics Clustering-- Fuzzy-HKmeans clustering model for protein sequence motif discovery Using Biclustering algorithm to improve clustering results Association Rules – Super-rules clustering by positional association rule Positional Association Super-Rule with different mapping mechanism Classification -- Protein local 3D structure prediction incorporate with Chou-Fasman parameter

Future Works

Research Topics Clustering-- Fuzzy-HKmeans clustering model for protein sequence motif discovery Using Biclustering algorithm to improve clustering results Association Rules – Super-rules clustering by positional association rule Positional Association Super-Rule with different mapping mechanism Classification -- Protein local 3D structure prediction incorporate with Chou-Fasman parameter

Future Works

Research Topics Clustering-- Fuzzy-HKmeans clustering model for protein sequence motif discovery Using Biclustering algorithm to improve clustering results Association Rules – Super-rules clustering by positional association rule Positional Association Super-Rule with different mapping mechanism Classification -- Protein local 3D structure prediction incorporate with Chou- Fasman parameter Protein local 3D structure prediction incorporate with Voting Mechnism