A Classification Data Set for PLM

Slides:

Advertisements

Similar presentations

Patient information extraction in digitized X-ray imagery Hsien-Huang P. Wu Department of Electrical Engineering, National Yunlin University of Science.

Advertisements

1 Section 7.3 Representing relations (part 1: matrices)

Image Categorization by Learning and Reasoning with Regions Yixin Chen, University of New Orleans James Z. Wang, The Pennsylvania State University Published.

(C) 2001 SNU CSE Biointelligence Lab Incremental Classification Using Tree- Based Sampling for Large Data H. Yoon, K. Alsabti, and S. Ranka Instance Selection.

Naive Bayes model Comp221 tutorial 4 (assignment 1) TA: Zhang Kai.

Input image Output image Transform equation All pixels Transform equation.

Medical Diagnosis via Genetic Programming Project #2 Artificial Intelligence: Biointelligence Computational Neuroscience Connectionist Modeling of Cognitive.

Aloha Aloha What you see: What the computer sees: binary number columns binary number columns

Kernel Classifiers from a Machine Learning Perspective (sec ) Jin-San Yang Biointelligence Laboratory School of Computer Science and Engineering.

CSE Introduction to Computing Concepts. Outline  What is an application program?  What is Excel?  Creating a Simple Workbook  Writing Formulas.

Lecture Set 12 Sequential Files and Structures Part C – Reading and Writing Binary Files.

Artificial Intelligence Project 1 Neural Networks Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.

MATLAB Practice 2 Introducing MATLAB Lecture Notes on Video Search & Mining, Spring 2012 Presented by Jun Hee Yoo Biointelligence Laboratory School of.

Artificial Intelligence Chapter 6 Robot Vision Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.

Confidential ACL Functions Corporate Audit Services Technology Solutions Team Charlene Vallandingham and Jack Hauschild September 29, 2008.

NOTATION FOR SOCIAL NETWORK DATA Three network schemas to represent a wide range of network data Graph theoretic Sociometric Algebraic A graph consists.

Stochastic Computing with Biomolecular Automata R. Adar, Y. Benenson, G. Linshiz, A. Rosner, N. Tishby, and E. Shapiro PNAS, vol. 101, no. 27, pp ,

Levels of Image Data Representation 4.2. Traditional Image Data Structures 4.3. Hierarchical Data Structures Chapter 4 – Data structures for.

Artificial Intelligence Project 1 Neural Networks Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.

Artificial Intelligence Project #3 : Diagnosis Using Bayesian Networks May 19, 2005.

(c) 2000, 2001 SNU CSE Biointelligence Lab Finding Region Another method for processing image  to find “regions” Finding regions  Finding outlines.

Chapter 9. PlayMate System (1/2) in Cognitive Systems, Henrik Iskov Chritensen et al. Course: Robots Learning from Humans Kwak, Hanock Biointelligence.

Analysis of Classification Algorithms In Handwritten Digit Recognition Logan Helms Jon Daniele.

CSE 534 Final Project Internet Outage Analysis Name: Guanyu Zhu, Wei-Ting Lin, Zhaowei Sun Professor: Phillipa Gill.

Artificial Intelligence Project 1 Neural Networks Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.

Binary Arithmetic for DNA Computers R. Barua and J. Misra Preliminary Proceedings of the Eighth International Meeting on DNA Based Computers, pp ,

6.4 Random Fields on Graphs 6.5 Random Fields Models In “Adaptive Cooperative Systems” Summarized by Ho-Sik Seok.

Digital Image Processing

(C) 2002, SNU Biointelligence Lab, Strategies for the development of a peptide computer Hubert Hug and Rainer Schuler Bioinformatics,

Reference data & Accuracy Assessment Dr. Russ Congalton Kamini Yadav.

Learning Kernel Classifiers 1. Introduction Summarized by In-Hee Lee.

Matrix Multiplication The Introduction. Look at the matrix sizes.

= the matrix for T relative to the standard basis is a basis for R 2. B is the matrix for T relative to To find B, complete:

Chapter 4. Analysis of Brain-Like Structures and Dynamics (2/2) Creating Brain-Like Intelligence, Sendhoff et al. Course: Robots Learning from Humans 09/25.

Lesson 5-4 Example Example 1 Draw an array to model and find 21 ÷ 3. 1.Write the answer if you know it. Otherwise, draw an array.

Week 4: 6/6 – 6/10 Jeffrey Loppert. This week.. Coded a Histogram of Oriented Gradients (HOG) Feature Extractor Extracted features from positive and negative.

Molecular Evolutionary Computing (MEC) for Maximum Clique Problems March 9, 2004 Biointelligence Laboratory School of Computer Science and Engineering.

Matrix Multiplication Example 1 Original author: Jeffrey Bivin, Lake Zurich High School.

Artificial Intelligence Chapter 11 Alternative Search Formulations and Applications.

Презентацию подготовила Хайруллина Ч.А. Муслюмовская гимназия Подготовка к части С ЕГЭ.

Chapter 9. The PlayMate System （ 2/2 ） in Cognitive Systems Monographs. Rüdiger Dillmann et al. Course: Robots Learning from Humans Summarized by Nan Changjun.

Artificial Intelligence DNA Hypernetworks Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.

Content Based Coding of Face Images

(Project) by:- ROHAN HIMANSHU ANUP 70282

Supervised Training and Classification

Matrix Multiplication

A Surface-Based DNA Algorithm for the Expansion of Symbolic Determinants Z. Frank Qiu and Mi Lu Third Workshop on Bio-Inspired Solutions to Parallel Processing.

An Introduction to Support Vector Machines

Chapter 6. Robot Vision.

Main Project total points: 500

DNA-Based Computation Times

Representing Images 2.6 – Data Representation.

SMEM Algorithm for Mixture Models

Aapo Hyvärinen and Ella Bingham

Subhayu Basu et al. , DNA8, (2002) MEC Seminar Su Dong Kim

30 A 30 B 30 C 30 D 30 E 77 TOTALS ORIGINAL COUNT CURRENT COUNT

DNA-based Parallel Computation of Simple Arithmetic

Operation of a Purified DNA nanoactuator

A Fast Fixed-Point Algorithm for Independent Component Analysis

Discrete Mathematics Lecture 12: Graph Theory

Digital Image Processing

Guideline Try to summarize to express explicitly

Artificial Intelligence Chapter 7 Agents That Plan

Parallel BFS for Maximum Clique Problems

Introduction to Spreadsheet Terminology

Restructuring Sparse High Dimensional Data for Effective Retrieval

Pattern Recognition and Training

Pattern Recognition and Training

Designs for Autonomous Unidirectional Walking DNA Devices

Universal Biochip Readout of Directed Hamiltonian Path Problems

Presentation transcript:

A Classification Data Set for PLM Information Theory of Learning Sep. 15, 2005 (c) 2000-2005 SNU CSE Biointelligence Lab, http://bi.snu.ac.kr

Introduction to Data (1) Handwritten digits (0 ~ 9) From 32x32 bitmaps, non-overlapping 4x4 blocks are extracted. (c) 2000-2005 SNU CSE Biointelligence Lab, http://bi.snu.ac.kr

Introduction to Data (2) # of on pixels are counted in each block. (Range: 0 ~ 16) If # >   1, otherwise 0 Original 32x32 bitmap is reduced to 8x8 binary matrix. 1 (c) 2000-2005 SNU CSE Biointelligence Lab, http://bi.snu.ac.kr

Introduction to Data (3) train.txt: 3823 examples test.txt: 1797 examples Representation In the text files, each row consists of 64 binary values with its label attached at 65-th column. Class distribution 1 2 3 4 5 6 7 8 9 Train 376 389 380 387 377 382 Test 178 182 177 183 181 179 174 180 (c) 2000-2005 SNU CSE Biointelligence Lab, http://bi.snu.ac.kr

(c) 2000-2005 SNU CSE Biointelligence Lab, http://bi.snu.ac.kr

(c) 2000-2005 SNU CSE Biointelligence Lab, http://bi.snu.ac.kr Preliminary Result k-nn result (k = 3) on the test set Accuray: 93.10% (ratio of correctly classified) a b c d e f g h i j <-- classified as 174 0 0 0 1 1 2 0 0 0 | a = 0 0 178 1 0 1 0 2 0 0 0 | b = 1 0 9 167 0 0 0 0 1 0 0 | c = 2 1 2 0 174 0 1 0 1 2 2 | d = 3 0 11 0 0 168 0 0 0 0 2 | e = 4 0 2 0 1 1 172 1 0 0 5 | f = 5 2 1 0 0 0 1 176 0 1 0 | g = 6 0 0 1 0 1 0 0 174 1 2 | h = 7 1 16 4 7 1 6 2 1 132 4 | i = 8 2 2 0 10 0 4 0 1 3 158 | j = 9 (c) 2000-2005 SNU CSE Biointelligence Lab, http://bi.snu.ac.kr