MINING GRAPH DATA EDITED BY. Diane J. Cook School of Electrical Engineering and Computei' Science Washington State University Puliman, Washington
|
|
- Melina Christine Sharp
- 6 years ago
- Views:
Transcription
1 MINING GRAPH DATA EDITED BY Diane J. Cook School of Electrical Engineering and Computei' Science Washington State University Puliman, Washington Lawrence B. Holder School of Electrical Engineering and Computer Science Washington State University Puliman, Washington BICINTlUNIfl Jl O 7 l WILEY: ; <n\ ftlcintinhial WILEY-INTERSC1ENCE A JOHN WILEY & SONS, INC., PUBLICATION
2 CONTENTS Preface Acknowledgments Contributors xiii xv xvn 1 INTRODUCTION 1 Lawrence B. Holder and Diane J. Cook 1.1 Terminology Graph Databases 3 i.3 Book Overview 10 References 11 Part I GRAPHS 15 2 GRAPH MATCHING EXACT AND ERROR-TOLERANT METHODS AND THE AUTOMATIC LEARNING OF EDIT COSTS 17 Horst Bunke and Michel Neuhaus 2.1 Introductkm Definitions and Graph Matching Methods Learning Edit Costs Experimental Evaluation Discussion and Conelusions 31 References 32 3 GRAPH VISUALIZATION AND DATA MINING 35 Walter Didimo and Giuseppe Liotta 3.1 Introduction Graph Drawing Techniques Examples of Visualization Systems 48 vii
3 viii CONTENTS 3.4 Conclusions 55 Rer'erences 57 4 GRAPH PATTERNS AND THE R-MAT GENERATOR 65 Deepayan Chakrabarti and Christas Faioutsos 4.1 Introdüction Background and Related Work NetMine and R-MAT Experiments Conciusions 86 References 92 Part II MINING TECHNIQUES 97 5 DISCOVERY OF FREQUENT SUBSTRUCTURES 99 Xifeng Yan and Jiawei Han 5.1 Introdüction Preliminary Concepts Apriori4)ased Approach Pattern Growth Approach Variant Substrueture Patterns Experiments and Performance Study Conclusions 112 References FINDING TOPOLOGICAL FREQUENT PATTERNS FROM GRAPH DATASETS 117 Michihiro Kuramochi and George Karypis 6.1 Introdüction Background Definitions and Notation Frequent Pattern Discovery from Graph Datasets Problem Definitions FSG for the Graph-Transaction Setting S-GKAM tbr the Single-Graph Setting GREW Scalable Frequem Subgraph Discovery Algorithm Related Research Conclusions 151 References UNSUPERVISED AND SUPERVISED PATTERN LEARNING IN GRAPH DATA 159 Diane J. Cook, Lawrence B. Holder, and Nikhil Keikar 7.1 Introdüction 159
4 CONTENTS ix 7.2 Mining Graph Data Using Subdue Comparison to Other Graph-Based Mining Algorithms Comparison to Frequent Substructure Mining Approaches Comparison to ILP Approaches Conclusions 179 References GRAPH GRAMMAR LEARNING 183 Istvan Jonyer 8.1 Introduction Related Work Graph Grammar Learning Empirical Evaluation Conclusion 199 References CONSTRUCTING DECISION TREE BASED ON CHUNKINGLESS GRAPH-BASED INDUCTION 203 Kouzou Ohara, Phu Chien Nguyen, Akira Mogi, Hiroshi Motoda, and Takashi Washio 9.1 Introduction Graph-Based Induction Revisited Problem Caused by Chunking in B-GBI Chunkingless Graph-Based Induction (Cl-GBI) Decision Tree Chunkingless Graph-Based Induction (DT-C1GBI) Conclusions 224 References SOWIE LINKS BETWEEN FORMAL CONCEPT ANALYSIS AND GRAPH MINING 227 Michel Liquiere 10.1 Presentation Basic Concepts and Notation Formal Concept Analysis Extension Lattice and Description Lattice Give Concept Lattice Graph Description and Galois Lattice Graph Mining and Formal Propositionalization Conclusion 249 References 250
5 X CONTENTS 11 KERNEL METHODS FOR GRAPHS 253 Thomas Gärtner, Tamäs Horvath, Quoc V, Le, Alex J. Smola, and Stefan Wrobel 11.1 Introduction 11.2 Graph Classification 11.3 Vertex Classification 11.4 Conclusions and Future Work References KERNELS AS LINK ANALYSIS MEASURES Masashi Shimbo and Takahiko Ito 12.1 Introduction 12.2 Preliminaries 12.3 Kernel-based Unified Framework for Importance and Relatedness 12.4 Laplacian Kernels as a Relatedness Measure 12.5 Practical Issues 12.6 Related Work 12.7 Evaluation with Bibliographie Citation Data 12,8 Summary References ENTITY RESOLUTION IN GRAPHS 311 Indrajit Bhattacharya and Lise Getoor 13.1 Introduction Related Work Motivating Example for Graph-Based Entity Resolution Graph-Based Entity Resolution: Problem Formulation Similarity Measures for Entity Resolution Graph-Based Clustering for Entity Resolution Experimental Evaluation 333!3.8 Conclusion 341 References 342 Part III APPLICATIONS MINING FROM CHEMICAL GRAPHS 347 Takashi Okada 14.1 Introduction and Representation of Molecules Issues for Mining CASE: A Prototype Mining System in Chemistry Quantitative Estimation Using Graph Mining Extension of Linear Fragments to Graphs 362
6 CONTENTS xi 14.6 Combination of Conditions Concluding Remarks 375 References UNIFIED APPROACH TO ROOTED TREE MINING: ALGORITHMS AND APPLICATIONS 381 Mohammed Zaki 15.1 Introducüon Preliminaries Related Work Generaüng Candidate Subtrees Frequency Computation Counting Distinct Occurrences The SLEUTH Algorithm Experimental Results Tree Mining Applications in Bioinformatics Conclusions 409 References DENSE SUBGRAPH EXTRACTION 411 Andrew Tomkins and Ravi Kumar Introduction Related Work Finding the densest subgraph Trawling Graph Shingling Connection Subgraphs Conclusions References SOCIAL NETWORK ANALYSIS 443 Sherry E. Marcus, Melanie Moy, and Thayne Cojfman 17.1 Introduction Social Network Analysis Group Detection Terrorist Modus Operandi Detection System Computational Experiments Conclusion 467 References 468 Index 469
MINING GRAPH DATA EDITED BY. Diane J. Cook. Lawrence B. Holder WILEY-INTERSCIENCE A JOHN WILEY & SONS, INC., PUBLICATION
MINING GRAPH DATA EDITED BY Diane J. Cook School of Electrical Engineering and Computer Science Washington State University Pullman, Washington Lawrence B. Holder School of Electrical Engineering and Computer
More informationData Mining in Bioinformatics Day 3: Graph Mining
Graph Mining and Graph Kernels Data Mining in Bioinformatics Day 3: Graph Mining Karsten Borgwardt & Chloé-Agathe Azencott February 6 to February 17, 2012 Machine Learning and Computational Biology Research
More informationIn Mathematics and computer science, the study of graphs is graph theory where graphs are data structures used to model
ISSN: 0975-766X CODEN: IJPTFI Available Online through Research Article www.ijptonline.com A BRIEF REVIEW ON APPLICATION OF GRAPH THEORY IN DATA MINING Abhinav Chanana*, Tanya Rastogi, M.Yamuna VIT University,
More informationGraph-based Learning. Larry Holder Computer Science and Engineering University of Texas at Arlington
Graph-based Learning Larry Holder Computer Science and Engineering University of Texas at Arlingt 1 Graph-based Learning Multi-relatial data mining and learning SUBDUE graph-based relatial learner Discovery
More informationSubdue: Compression-Based Frequent Pattern Discovery in Graph Data
Subdue: Compression-Based Frequent Pattern Discovery in Graph Data Nikhil S. Ketkar University of Texas at Arlington ketkar@cse.uta.edu Lawrence B. Holder University of Texas at Arlington holder@cse.uta.edu
More informationData Mining in Bioinformatics Day 5: Graph Mining
Data Mining in Bioinformatics Day 5: Graph Mining Karsten Borgwardt February 25 to March 10 Bioinformatics Group MPIs Tübingen from Borgwardt and Yan, KDD 2008 tutorial Graph Mining and Graph Kernels,
More informationExtraction of Frequent Subgraph from Graph Database
Extraction of Frequent Subgraph from Graph Database Sakshi S. Mandke, Sheetal S. Sonawane Deparment of Computer Engineering Pune Institute of Computer Engineering, Pune, India. sakshi.mandke@cumminscollege.in;
More informationPattern Mining in Frequent Dynamic Subgraphs
Pattern Mining in Frequent Dynamic Subgraphs Karsten M. Borgwardt, Hans-Peter Kriegel, Peter Wackersreuther Institute of Computer Science Ludwig-Maximilians-Universität Munich, Germany kb kriegel wackersr@dbs.ifi.lmu.de
More informationManaging and Mining Graph Data
Managing and Mining Graph Data by Charu C. Aggarwal IBM T.J. Watson Research Center Hawthorne, NY, USA Haixun Wang Microsoft Research Asia Beijing, China
More informationGraph Mining Sub Domains and a Framework for Indexing A Graphical Approach
Graph Mining Sub Domains and a Framework for Indexing A Graphical Approach K. Vivekanandan Professor BSMED A. Pankaj Moses Monickaraj (Correspoding author) Doctoral Scholar Department of Computer Science
More informationUsing a Hash-Based Method for Apriori-Based Graph Mining
Using a Hash-Based Method for Apriori-Based Graph Mining Phu Chien Nguyen, Takashi Washio, Kouzou Ohara, and Hiroshi Motoda The Institute of Scientific and Industrial Research, Osaka University 8-1 Mihogaoka,
More informationData Mining in Bioinformatics Day 5: Frequent Subgraph Mining
Data Mining in Bioinformatics Day 5: Frequent Subgraph Mining Chloé-Agathe Azencott & Karsten Borgwardt February 18 to March 1, 2013 Machine Learning & Computational Biology Research Group Max Planck Institutes
More informationGraph-based Relational Learning with Application to Security
Fundamenta Informaticae 66 (2005) 1 19 1 IS Press Graph-based Relational Learning with Application to Security Lawrence Holder Λ, Diane Cook, Jeff Coble and Maitrayee Mukherjee Department of Computer Science
More informationA Roadmap to an Enhanced Graph Based Data mining Approach for Multi-Relational Data mining
A Roadmap to an Enhanced Graph Based Data mining Approach for Multi-Relational Data mining D.Kavinya 1 Student, Department of CSE, K.S.Rangasamy College of Technology, Tiruchengode, Tamil Nadu, India 1
More informationUsing Graphs to Improve Activity Prediction in Smart Environments based on Motion Sensor Data
Using Graphs to Improve Activity Prediction in Smart Environments based on Motion Sensor Data S. Seth Long and Lawrence B. Holder Washington State University Abstract. Activity Recognition in Smart Environments
More informationPart I: Data Mining Foundations
Table of Contents 1. Introduction 1 1.1. What is the World Wide Web? 1 1.2. A Brief History of the Web and the Internet 2 1.3. Web Data Mining 4 1.3.1. What is Data Mining? 6 1.3.2. What is Web Mining?
More informationGraph-Based Hierarchical Conceptual Clustering
From: FLAIRS-00 Proceedings. opyright 2000, AAAI (www.aaai.org). All rights reserved. Graph-Based Hierarchical onceptual lustering Istvan Jonyer, Lawrence B. Holder and Diane J. ook Department of omputer
More informationEMPIRICAL COMPARISON OF GRAPH CLASSIFICATION AND REGRESSION ALGORITHMS. By NIKHIL S. KETKAR
EMPIRICAL COMPARISON OF GRAPH CLASSIFICATION AND REGRESSION ALGORITHMS By NIKHIL S. KETKAR A dissertation submitted in partial fulfillment of the requirements for the degree of DOCTORATE OF PHILOSOPHY
More informationHierarchical Clustering of Process Schemas
Hierarchical Clustering of Process Schemas Claudia Diamantini, Domenico Potena Dipartimento di Ingegneria Informatica, Gestionale e dell'automazione M. Panti, Università Politecnica delle Marche - via
More informationEfficient homomorphism-free enumeration of conjunctive queries
Efficient homomorphism-free enumeration of conjunctive queries Jan Ramon 1, Samrat Roy 1, and Jonny Daenen 2 1 K.U.Leuven, Belgium, Jan.Ramon@cs.kuleuven.be, Samrat.Roy@cs.kuleuven.be 2 University of Hasselt,
More informationA New Approach To Graph Based Object Classification On Images
A New Approach To Graph Based Object Classification On Images Sandhya S Krishnan,Kavitha V K P.G Scholar, Dept of CSE, BMCE, Kollam, Kerala, India Sandhya4parvathy@gmail.com Abstract: The main idea of
More informationDiscovering Frequent Geometric Subgraphs
Discovering Frequent Geometric Subgraphs Michihiro Kuramochi and George Karypis Department of Computer Science/Army HPC Research Center University of Minnesota 4-192 EE/CS Building, 200 Union St SE Minneapolis,
More informationContents. Preface to the Second Edition
Preface to the Second Edition v 1 Introduction 1 1.1 What Is Data Mining?....................... 4 1.2 Motivating Challenges....................... 5 1.3 The Origins of Data Mining....................
More informationInnovative Study to the Graph-based Data Mining: Application of the Data Mining
Innovative Study to the Graph-based Data Mining: Application of the Data Mining Amit Kr. Mishra, Pradeep Gupta, Ashutosh Bhatt, Jainendra Singh Rana Abstract Graph-based data mining represents a collection
More informationMining Minimal Contrast Subgraph Patterns
Mining Minimal Contrast Subgraph Patterns Roger Ming Hieng Ting James Bailey Abstract In this paper, we introduce a new type of contrast pattern, the minimal contrast subgraph. It is able to capture structural
More informationAC-Close: Efficiently Mining Approximate Closed Itemsets by Core Pattern Recovery
: Efficiently Mining Approximate Closed Itemsets by Core Pattern Recovery Hong Cheng Philip S. Yu Jiawei Han University of Illinois at Urbana-Champaign IBM T. J. Watson Research Center {hcheng3, hanj}@cs.uiuc.edu,
More informationRelational Learning. Jan Struyf and Hendrik Blockeel
Relational Learning Jan Struyf and Hendrik Blockeel Dept. of Computer Science, Katholieke Universiteit Leuven Celestijnenlaan 200A, 3001 Leuven, Belgium 1 Problem definition Relational learning refers
More informationMining frequent Closed Graph Pattern
Mining frequent Closed Graph Pattern Seminar aus maschninellem Lernen Referent: Yingting Fan 5.November Fachbereich 21 Institut Knowledge Engineering Prof. Fürnkranz 1 Outline Motivation and introduction
More informationgspan: Graph-Based Substructure Pattern Mining
University of Illinois at Urbana-Champaign February 3, 2017 Agenda What motivated the development of gspan? Technical Preliminaries Exploring the gspan algorithm Experimental Performance Evaluation Introduction
More informationDiscovering Frequent Topological Structures from Graph Datasets
Discovering Frequent Topological Structures from Graph Datasets R. Jin C. Wang D. Polshakov S. Parthasarathy G. Agrawal Department of Computer Science and Engineering Ohio State University, Columbus OH
More informationMARGIN: Maximal Frequent Subgraph Mining Λ
MARGIN: Maximal Frequent Subgraph Mining Λ Lini T Thomas Satyanarayana R Valluri Kamalakar Karlapalem enter For Data Engineering, IIIT, Hyderabad flini,satyag@research.iiit.ac.in, kamal@iiit.ac.in Abstract
More informationTASK SCHEDULING FOR PARALLEL SYSTEMS
TASK SCHEDULING FOR PARALLEL SYSTEMS Oliver Sinnen Department of Electrical and Computer Engineering The University of Aukland New Zealand TASK SCHEDULING FOR PARALLEL SYSTEMS TASK SCHEDULING FOR PARALLEL
More informationMonotone Constraints in Frequent Tree Mining
Monotone Constraints in Frequent Tree Mining Jeroen De Knijf Ad Feelders Abstract Recent studies show that using constraints that can be pushed into the mining process, substantially improves the performance
More informationMining Interesting Itemsets in Graph Datasets
Mining Interesting Itemsets in Graph Datasets Boris Cule Bart Goethals Tayena Hendrickx Department of Mathematics and Computer Science University of Antwerp firstname.lastname@ua.ac.be Abstract. Traditionally,
More informationHigh-Performance Parallel Database Processing and Grid Databases
High-Performance Parallel Database Processing and Grid Databases David Taniar Monash University, Australia Clement H.C. Leung Hong Kong Baptist University and Victoria University, Australia Wenny Rahayu
More informationStochastic propositionalization of relational data using aggregates
Stochastic propositionalization of relational data using aggregates Valentin Gjorgjioski and Sašo Dzeroski Jožef Stefan Institute Abstract. The fact that data is already stored in relational databases
More informationData Mining: Concepts and Techniques. Graph Mining. Graphs are Everywhere. Why Graph Mining? Chapter Graph mining
Data Mining: Concepts and Techniques Chapter 9 9.1. Graph mining Jiawei Han and Micheline Kamber Department of Computer Science University of Illinois at Urbana-Champaign www.cs.uiuc.edu/~hanj 2006 Jiawei
More informationGraph-Based Concept Learning
Graph-Based Concept Learning Jesus A. Gonzalez, Lawrence B. Holder, and Diane J. Cook Department of Computer Science and Engineering University of Texas at Arlington Box 19015, Arlington, TX 76019-0015
More informationGRAPH MINING AND GRAPH KERNELS
GRAPH MINING AND GRAPH KERNELS Part II: Graph Kernels Karsten Borgwardt^ and Xifeng Yan* ^University of Cambridge *IBM T. J. Watson Research Center August 24, 2008 ACM SIG KDD, Las Vegas Frequent Subgraph
More informationBing Liu. Web Data Mining. Exploring Hyperlinks, Contents, and Usage Data. With 177 Figures. Springer
Bing Liu Web Data Mining Exploring Hyperlinks, Contents, and Usage Data With 177 Figures Springer Table of Contents 1. Introduction 1 1.1. What is the World Wide Web? 1 1.2. A Brief History of the Web
More informationNumeric Ranges Handling for Graph Based Knowledge Discovery Oscar E. Romero A., Jesús A. González B., Lawrence B. Holder
Numeric Ranges Handling for Graph Based Knowledge Discovery Oscar E. Romero A., Jesús A. González B., Lawrence B. Holder Reporte Técnico No. CCC-08-003 27 de Febrero de 2008 2008 Coordinación de Ciencias
More informationEdgar: the Embedding-baseD GrAph MineR
Edgar: the Embedding-baseD GrAph MineR Marc Wörlein, 1 Alexander Dreweke, 1 Thorsten Meinl, 2 Ingrid Fischer 2, and Michael Philippsen 1 1 University of Erlangen-Nuremberg, Computer Science Department
More informationCanonical Forms for Frequent Graph Mining
Canonical Forms for Frequent Graph Mining Christian Borgelt Dept. of Knowledge Processing and Language Engineering Otto-von-Guericke-University of Magdeburg borgelt@iws.cs.uni-magdeburg.de Summary. A core
More informationEdgar: the Embedding-baseD GrAph MineR
Edgar: the Embedding-baseD GrAph MineR Marc Wörlein, 1 Alexander Dreweke, 1 Thorsten Meinl, 2 Ingrid Fischer 2, and Michael Philippsen 1 1 University of Erlangen-Nuremberg, Computer Science Department
More informationRELATIONAL APPROACH TO MODELING AND IMPLEMENTING SUBTLE ASPECTS OF GRAPH MINING
Department of Computer Science and Engineering University of Texas at Arlington Arlington, TX 76019 RELATIONAL APPROACH TO MODELING AND IMPLEMENTING SUBTLE ASPECTS OF GRAPH MINING Ramanathan Balachandran
More informationContents. Foreword to Second Edition. Acknowledgments About the Authors
Contents Foreword xix Foreword to Second Edition xxi Preface xxiii Acknowledgments About the Authors xxxi xxxv Chapter 1 Introduction 1 1.1 Why Data Mining? 1 1.1.1 Moving toward the Information Age 1
More informationFinding Neighbor Communities in the Web using Inter-Site Graph
Finding Neighbor Communities in the Web using Inter-Site Graph Yasuhito Asano 1, Hiroshi Imai 2, Masashi Toyoda 3, and Masaru Kitsuregawa 3 1 Graduate School of Information Sciences, Tohoku University
More informationMin-Hashing for Probabilistic Frequent Subtree Feature Spaces
Min-Hashing for Probabilistic Frequent Subtree Feature Spaces Pascal Welke 1, Tamás Horváth 1,2, and Stefan Wrobel 1,2 1 Dept. of Computer Science, University of Bonn, Germany 2 Fraunhofer IAIS, Schloss
More informationFP-GROWTH BASED NEW NORMALIZATION TECHNIQUE FOR SUBGRAPH RANKING
FP-GROWTH BASED NEW NORMALIZATION TECHNIQUE FOR SUBGRAPH RANKING E.R.Naganathan 1 S.Narayanan 2 K.Ramesh kumar 3 1 Department of Computer Applications, Velammal Engineering College Ambattur-Redhills Road,
More informationEpilog: Further Topics
Ludwig-Maximilians-Universität München Institut für Informatik Lehr- und Forschungseinheit für Datenbanksysteme Knowledge Discovery in Databases SS 2016 Epilog: Further Topics Lecture: Prof. Dr. Thomas
More informationParallelizing Frequent Itemset Mining with FP-Trees
Parallelizing Frequent Itemset Mining with FP-Trees Peiyi Tang Markus P. Turkia Department of Computer Science Department of Computer Science University of Arkansas at Little Rock University of Arkansas
More informationMINING AND SEARCHING GRAPHS AND STRUCTURES
MINING AND SEARCHING GRAPHS AND STRUCTURES Jiawei Han Xifeng Yan Department of Computer Science University of Illinois at Urbana-Champaign Philip S. Yu IBM T. J. Watson Research Center http://ews.uiuc.edu/~xyan/tutorial/kdd06_graph.htm
More informationMining Significant Graph Patterns by Leap Search
Mining Significant Graph Patterns by Leap Search Xifeng Yan (IBM T. J. Watson) Hong Cheng, Jiawei Han (UIUC) Philip S. Yu (UIC) Graphs Are Everywhere Magwene et al. Genome Biology 2004 5:R100 Co-expression
More informationGraph-Based Anomaly Detection Applied to Homeland Security Cargo Screening
Proceedings of the Twenty-Fifth International Florida Artificial Intelligence Research Society Conference Graph-Based Anomaly Detection Applied to Homeland Security Cargo Screening William Eberle Department
More informationFrequent Pattern-Growth Approach for Document Organization
Frequent Pattern-Growth Approach for Document Organization Monika Akbar Department of Computer Science Virginia Tech, Blacksburg, VA 246, USA. amonika@cs.vt.edu Rafal A. Angryk Department of Computer Science
More informationGraph-Based Hierarchical Conceptual Clustering
Journal of Machine Learning Research 2 (2001) 19-43 Submitted 7/01; Published 10/01 Graph-Based Hierarchical Conceptual Clustering Istvan Jonyer Diane J. Cook Lawrence B. Holder Department of Computer
More informationGRAPH MINING AND GRAPH KERNELS
GRAPH MINING AND GRAPH KERNELS Part I: Graph Mining Karsten Borgwardt^ and Xifeng Yan* ^University of Cambridge *IBM T. J. Watson Research Center August 24, 2008 ACM SIG KDD, Las Vegas Graphs Are Everywhere
More informationThe Discovery and Retrieval of Temporal Rules in Interval Sequence Data
The Discovery and Retrieval of Temporal Rules in Interval Sequence Data by Edi Winarko, B.Sc., M.Sc. School of Informatics and Engineering, Faculty of Science and Engineering March 19, 2007 A thesis presented
More informationExploring graph mining approaches for dynamic heterogeneous networks
Georgetown University Institutional Repository http://www.library.georgetown.edu/digitalgeorgetown The author made this article openly available online. Please tell us how this access affects you. Your
More informationSemantic Web Technologies Trends and Research in Ontology-based Systems
Semantic Web Technologies Trends and Research in Ontology-based Systems John Davies BT, UK Rudi Studer University of Karlsruhe, Germany Paul Warren BT, UK John Wiley & Sons, Ltd Contents Foreword xi 1.
More informationAn Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data Akihiro Inokuchi, Takashi Washio, and Hiroshi Motoda I.S.I.R., Osaka University 8-1, Mihogaoka, Ibarakishi, Osaka, 567-0047,
More informationDETERMINISTIC OPERATIONS RESEARCH
DETERMINISTIC OPERATIONS RESEARCH Models and Methods in Optimization Linear DAVID J. RADER, JR. Rose-Hulman Institute of Technology Department of Mathematics Terre Haute, IN WILEY A JOHN WILEY & SONS,
More informationIliya Mitov 1, Krassimira Ivanova 1, Benoit Depaire 2, Koen Vanhoof 2
Iliya Mitov 1, Krassimira Ivanova 1, Benoit Depaire 2, Koen Vanhoof 2 1: Institute of Mathematics and Informatics BAS, Sofia, Bulgaria 2: Hasselt University, Belgium 1 st Int. Conf. IMMM, 23-29.10.2011,
More informationSelf-Organization in Sensor and Actor Networks
Self-Organization in Sensor and Actor Networks Falko Dressler University of Erlangen, Germany BICENTINNIAL BICINTINNIAL John Wiley & Sons, Ltd Contents Foreword Preface About the Author List of Abbreviations
More informationData Clustering in C++
Chapman & Hall/CRC Data Mining and Knowledge Discovery Series Data Clustering in C++ An Object-Oriented Approach Guojun Gan CRC Press Taylor & Francis Group Boca Raton London New York CRC Press Is an imprint
More informationIntroduction to Statistical Relational Learning
Introduction to Statistical Relational Learning Series Foreword Preface xi xiii 1 Introduction 1 Lise Getoor, Ben Taskar 1.1 Overview 1 1.2 Brief History of Relational Learning 2 1.3 Emerging Trends 3
More informationSymbol Detection Using Region Adjacency Graphs and Integer Linear Programming
2009 10th International Conference on Document Analysis and Recognition Symbol Detection Using Region Adjacency Graphs and Integer Linear Programming Pierre Le Bodic LRI UMR 8623 Using Université Paris-Sud
More informationSemi-supervised Learning
Semi-supervised Learning Piyush Rai CS5350/6350: Machine Learning November 8, 2011 Semi-supervised Learning Supervised Learning models require labeled data Learning a reliable model usually requires plenty
More informationInternational Journal of Advanced Research in Computer Science and Software Engineering
Volume 2, Issue 9, September 2012 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Discovery
More informationCODENSE v
CODENSE v1.0 ----------------- INTRODUCTION Given a relation graph dataset, D={G 1,G 2, G n }, where G i =(V,E i ), Definition 1 (Support) The support of a graph g is the number of graphs (in D) where
More informationMining Frequent Closed Unordered Trees Through Natural Representations
Mining Frequent Closed Unordered Trees Through Natural Representations José L. Balcázar, Albert Bifet and Antoni Lozano Universitat Politècnica de Catalunya, {balqui,abifet,antoni}@lsi.upc.edu Abstract.
More informationCS6220: DATA MINING TECHNIQUES
CS6220: DATA MINING TECHNIQUES Mining Graph/Network Data: Part I Instructor: Yizhou Sun yzsun@ccs.neu.edu November 12, 2013 Announcement Homework 4 will be out tonight Due on 12/2 Next class will be canceled
More informationKnowledge Discovery from Transportation Network Data
Knowledge Discovery from Transportation Network Data Paper Review Jiang, W., Vaidya, J., Balaporia, Z., Clifton, C., and Banich, B. Knowledge Discovery from Transportation Network Data. In ICDE, 2005 1
More informationFundamentals of Digital Image Processing
\L\.6 Gw.i Fundamentals of Digital Image Processing A Practical Approach with Examples in Matlab Chris Solomon School of Physical Sciences, University of Kent, Canterbury, UK Toby Breckon School of Engineering,
More informationGDClust: A Graph-Based Document Clustering Technique
GDClust: A Graph-Based Document Clustering Technique M. Shahriar Hossain, Rafal A. Angryk Department of Computer Science, Montana State University, Bozeman, MT 59715, USA E-mail: {mshossain, angryk}@cs.montana.edu
More informationManifold Learning Theory and Applications
Manifold Learning Theory and Applications Yunqian Ma and Yun Fu CRC Press Taylor Si Francis Group Boca Raton London New York CRC Press is an imprint of the Taylor & Francis Group, an informa business Contents
More informationGREW A Scalable Frequent Subgraph Discovery Algorithm
GREW A Scalable Frequent Subgraph Discovery Algorithm Michihiro Kuramochi and George Karypis Department of Computer Science and Engineering/ Army High Performance Computing Research Center/ Digital Technology
More informationPreface MOTIVATION ORGANIZATION OF THE BOOK. Section 1: Basic Concepts of Graph Theory
xv Preface MOTIVATION Graph Theory as a well-known topic in discrete mathematics, has become increasingly under interest within recent decades. This is principally due to its applicability in a wide range
More informationBusiness Intelligence Roadmap HDT923 Three Days
Three Days Prerequisites Students should have experience with any relational database management system as well as experience with data warehouses and star schemas. It would be helpful if students are
More informationGraph Mining and Social Network Analysis
Graph Mining and Social Network Analysis Data Mining and Text Mining (UIC 583 @ Politecnico di Milano) References q Jiawei Han and Micheline Kamber, "Data Mining: Concepts and Techniques", The Morgan Kaufmann
More informationClassification in Dynamic Streaming Networks
Classification in Dynamic Streaming Networks Yibo Yao and Lawrence B. Holder School of Electrical Engineering and Computer Science Washington State University Pullman, WA 99164, USA Email: {yibo.yao, holder}@wsu.edu
More information9.1. Graph Mining, Social Network Analysis, and Multirelational Data Mining. Graph Mining
9 Graph Mining, Social Network Analysis, and Multirelational Data Mining 9.1 We have studied frequent-itemset mining in Chapter 5 and sequential-pattern mining in Section 3 of Chapter 8. Many scientific
More informationPerformance Based Study of Association Rule Algorithms On Voter DB
Performance Based Study of Association Rule Algorithms On Voter DB K.Padmavathi 1, R.Aruna Kirithika 2 1 Department of BCA, St.Joseph s College, Thiruvalluvar University, Cuddalore, Tamil Nadu, India,
More informationPrivacy-Preserving. Introduction to. Data Publishing. Concepts and Techniques. Benjamin C. M. Fung, Ke Wang, Chapman & Hall/CRC. S.
Chapman & Hall/CRC Data Mining and Knowledge Discovery Series Introduction to Privacy-Preserving Data Publishing Concepts and Techniques Benjamin C M Fung, Ke Wang, Ada Wai-Chee Fu, and Philip S Yu CRC
More informationIntroduction p. 1 What is the World Wide Web? p. 1 A Brief History of the Web and the Internet p. 2 Web Data Mining p. 4 What is Data Mining? p.
Introduction p. 1 What is the World Wide Web? p. 1 A Brief History of the Web and the Internet p. 2 Web Data Mining p. 4 What is Data Mining? p. 6 What is Web Mining? p. 6 Summary of Chapters p. 8 How
More informationMining Query-Based Subnetwork Outliers in Heterogeneous Information Networks
Mining Query-Based Subnetwork Outliers in Heterogeneous Information Networks Honglei Zhuang, Jing Zhang 2, George Brova, Jie Tang 2, Hasan Cam 3, Xifeng Yan 4, Jiawei Han University of Illinois at Urbana-Champaign
More informationA Graph-Based Approach for Mining Closed Large Itemsets
A Graph-Based Approach for Mining Closed Large Itemsets Lee-Wen Huang Dept. of Computer Science and Engineering National Sun Yat-Sen University huanglw@gmail.com Ye-In Chang Dept. of Computer Science and
More informationMINING FREQUENT MAX AND CLOSED SEQUENTIAL PATTERNS
MINING FREQUENT MAX AND CLOSED SEQUENTIAL PATTERNS by Ramin Afshar B.Sc., University of Alberta, Alberta, 2000 THESIS SUBMITTED IN PARTIAL FULFILMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTER OF SCIENCE
More informationGRAPH-BASED HIERARCHICAL CONCEPTUAL CLUSTERING
GRAPH-BASED HIERARCHICAL CONCEPTUAL CLUSTERING ISTVAN JONYER, LAWRENCE B. HOLDER, and DIANE J. COOK University of Texas at Arlington Department of Computer Science and Engineering Box 19015 (416 Yates
More informationA Hierarchical Document Clustering Approach with Frequent Itemsets
A Hierarchical Document Clustering Approach with Frequent Itemsets Cheng-Jhe Lee, Chiun-Chieh Hsu, and Da-Ren Chen Abstract In order to effectively retrieve required information from the large amount of
More informationGraph Matching. Filtering Databases of Graphs Using Machine Learning Techniques
Graph Matching Filtering Databases of Graphs Using Machine Learning Techniques Inauguraldissertation der Philosophisch-naturwissenschaftlichen Fakultät der Universität Bern vorgelegt von Christophe-André
More informationEfficient Subtree Inclusion Testing in Subtree Discovering Applications
Efficient Subtree Inclusion Testing in Subtree Discovering Applications RENATA IVANCSY, ISTVAN VAJK Department of Automation and Applied Informatics and HAS-BUTE Control Research Group Budapest University
More informationDynamic Graph-based Relational Learning of Temporal Patterns in Biological Networks Changing over Time
Dynamic Graph-based Relational Learning of Temporal Patterns in Biological Networks Changing over Time Chang Hun You, Lawrence B. Holder and Diane J. Cook School of Electrical Engineering & Computer Science,
More informationComparison of FP tree and Apriori Algorithm
International Journal of Engineering Research and Development e-issn: 2278-067X, p-issn: 2278-800X, www.ijerd.com Volume 10, Issue 6 (June 2014), PP.78-82 Comparison of FP tree and Apriori Algorithm Prashasti
More informationTable Of Contents: xix Foreword to Second Edition
Data Mining : Concepts and Techniques Table Of Contents: Foreword xix Foreword to Second Edition xxi Preface xxiii Acknowledgments xxxi About the Authors xxxv Chapter 1 Introduction 1 (38) 1.1 Why Data
More informationLink Mining & Entity Resolution. Lise Getoor University of Maryland, College Park
Link Mining & Entity Resolution Lise Getoor University of Maryland, College Park Learning in Structured Domains Traditional machine learning and data mining approaches assume: A random sample of homogeneous
More informationPattern Recognition Using Graph Theory
ISSN: 2278 0211 (Online) Pattern Recognition Using Graph Theory Aditya Doshi Department of Computer Science and Engineering, Vellore Institute of Technology, Vellore, India Manmohan Jangid Department of
More informationgprune: A Constraint Pushing Framework for Graph Pattern Mining
gprune: A Constraint Pushing Framework for Graph Pattern Mining Feida Zhu Xifeng Yan Jiawei Han Philip S. Yu Computer Science, UIUC, {feidazhu,xyan,hanj}@cs.uiuc.edu IBM T. J. Watson Research Center, psyu@us.ibm.com
More informationParallelization of Graph Isomorphism using OpenMP
Parallelization of Graph Isomorphism using OpenMP Vijaya Balpande Research Scholar GHRCE, Nagpur Priyadarshini J L College of Engineering, Nagpur ABSTRACT Advancement in computer architecture leads to
More informationEpipolar Geometry in Stereo, Motion and Object Recognition
Epipolar Geometry in Stereo, Motion and Object Recognition A Unified Approach by GangXu Department of Computer Science, Ritsumeikan University, Kusatsu, Japan and Zhengyou Zhang INRIA Sophia-Antipolis,
More information