Business Intelligence and Process Modelling
|
|
- Evan Ramsey
- 7 years ago
- Views:
Transcription
1 Business Intelligence and Process Modelling F.W. Takes Universiteit Leiden Lecture 7: Network Analytics & Process Modelling Introduction BIPM Lecture 7: Network Analytics & Process Modelling Introduction 1 / 54
2 Where are we? Business Intelligence: anything that aims at providing actionable information that can be used to support business decision making Business Analysis Business Analytics Visual Analytics Descriptive Analytics Predictive Analytics Network Intelligence: Network Science in a BI context Process Modelling BIPM Lecture 7: Network Analytics & Process Modelling Introduction 2 / 54
3 Network Science for BI BIPM Lecture 7: Network Analytics & Process Modelling Introduction 3 / 54
4 Data Network Science (recap) Data Data Analysis Data Mining Data Science Big Data Network science: analyzing big structured data consisting of objects connected via certain relationships, in short: networks Interest from: mathematics, computer science, physics, biology, public administration, social sciences,... BIPM Lecture 7: Network Analytics & Process Modelling Introduction 4 / 54
5 Notation (recap) Concept Symbol Network (graph) G = (V, E) Objects (nodes/vertices) Relations (links/edges) Directed E V V Undirected Number of nodes V Number of edges E We assume no self-edges (u, u) and no parallel edges V E n m BIPM Lecture 7: Network Analytics & Process Modelling Introduction 5 / 54
6 Small World Networks (recap) 1 Sparse networks density 2 Fat-tailed power-law degree distribution degree 3 Giant component components 4 Low pairwise node-to-node distances distance Many real-world networks: communication networks, citation networks, collaboration networks (Erdös, Kevin Bacon), protein interaction networks, information networks (Wikipedia), webgraphs, financial networks (Bitcoin)... BIPM Lecture 7: Network Analytics & Process Modelling Introduction 6 / 54
7 Topics Graph Representation and Structure Paths and Distances Graph Evolution, Link Prediction Spidering and Sampling Centrality Visualization Algorithms and Tools Graph Compression Community Detection Contagion, Gossipping and Virality Privacy, Anonymity and Ethics BIPM Lecture 7: Network Analytics & Process Modelling Introduction 7 / 54
8 Network evolution Graphs evolve over time Social networks: users join the network and create new friendships Webgraphs: new pages and links to pages appear on the internet Scientific networks: new papers are being co-authored and new citations are made in these papers Interesting: small world properties emerge and are preserved during evolution! BIPM Lecture 7: Network Analytics & Process Modelling Introduction 8 / 54
9 Evolving graphs Graph G t = (V t, E t ) Time window 0 t T 1 Usually at t = 0, either V 0 = and a new edge may bring new nodes, or V 0 = V T 1 and only edges are added at each timestamp Timestamp on node v V : t(v) [0; T 1] Timestamp on edge e E: t(e) [0; T 1], or as common input format: e = (u, v, t (u,v) ) with u, v V and t (u,v) [0, T 1] u v t as line contents of an edge list file BIPM Lecture 7: Network Analytics & Process Modelling Introduction 9 / 54
10 LIACS collaboration network (v2012) BIPM Lecture 7: Network Analytics & Process Modelling Introduction 10 / 54
11 Two schools Synthetic graphs model-driven Model or algorithm to generate graphs from scratch Tune parameters to obtain a graph similar to an observed network Statistical analysis Real-world graphs data-driven Obtain data from an actual network Compute and derive properties and determine similarity with other networks Computational analysis BIPM Lecture 7: Network Analytics & Process Modelling Introduction 11 / 54
12 Apple collaboration network BIPM Lecture 7: Network Analytics & Process Modelling Introduction 12 / 54
13 Link prediction Link prediction problem: given a network G t = (V t, E t ), denoting the network at time t, predict the newly formed links in the evolved network G t = (V t, E t ) at time t > t, i.e., predict the contents of E t \E t. BIPM Lecture 7: Network Analytics & Process Modelling Introduction 13 / 54
14 Link prediction Link prediction problem: given a network G t = (V t, E t ), denoting the network at time t, predict the newly formed links in the evolved network G t = (V t, E t ) at time t > t, i.e., predict the contents of E t \E t. Applicable to weighted and unweighted, directed and undirected networks Supervised learning problem Features based on the structure of the network Train on first 95%, test on last 5% (randomized) Validate result using AUROC J.E. van Engelen, H.D. Boekhout and F.W. Takes, Explainable and Efficient Link Prediction in Real-World Networks (working paper), BIPM Lecture 7: Network Analytics & Process Modelling Introduction 13 / 54
15 Feature set goals efficient in terms of time complexity; accurate in its future link predictions; explainable in its performance based on simple features; consistent in its accuracy relative to larger feature sets across networks; generic, yielding reliable results across a broad range of networks. BIPM Lecture 7: Network Analytics & Process Modelling Introduction 14 / 54
16 Link prediction features Compute features for each possible future edge (i, j) / E t Node features: degree, volume (total weight) Neighborhood features: neighbor count, common neighbor count, transitive common neighborhood, Jaccard coefficient, preferential attachment, and others Path features: shortest path length, number of shortest paths, restricted Katz measure, and others BIPM Lecture 7: Network Analytics & Process Modelling Introduction 15 / 54
17 Efficient Feature Set (EFS) Large number of features Black box type of approach Cover individual, local and global properties Explainable result Efficient Feature Set BIPM Lecture 7: Network Analytics & Process Modelling Introduction 16 / 54
18 Node features Feature Variant Complexity EFS Degree (source) - O(1) Degree (source) d in O(1) Degree (source) d out O(1) Degree (target) - O(1) Degree (target) d in O(1) Degree (target) d out O(1) Volume (source) - O(m/n) Volume (source) d in O(m/n) Volume (source) d out O(m/n) Volume (target) - O(m/n) Volume (target) d in O(m/n) Volume (target) d out O(m/n) Neighbourhood features Total neighbours - O(m/n) Total neighbours Γ in O(m/n) Total neighbours Γ out O(m/n) Common neighbours - O(m/n) Common neighbours Γ in O(m/n) Common neighbours Γ out O(m/n) Transitive comm. neigh. - O(m/n) Jaccard Coeff. - O(m/n) Jaccard Coeff. Γ in O(m/n) Jaccard Coeff. Γ out O(m/n) Transitive Jacc. Coeff. - O(m/n) Adamic/Adar - O(m/n) Preferential attachment - O(1) Preferential attachment Γ in O(1) Preferential attachment Γ out O(1) Opposite direction link - O(1) Path features Shortest path length - O(m + n) Num. shortest paths l max = 3 O(m + n) Restricted Katz measure l max = 3, O(m + n) β = 0.05 PropFlow l max = 3 O(m + n)
19 Datasets Table : Characteristics of network data sets used for testing Data set Nodes Links CC Type Dist 3N digg 30,398 86, D % fb-links 63, , U % fb-wall 46, , D % infectious 410 2, U % liacs 1,036 4, U % lkml-reply 27, , D % slashdot 51, , D % topology 34, , U % ucsocial 1,899 20, D % wikipedia 100, , D % BIPM Lecture 7: Network Analytics & Process Modelling Introduction 18 / 54
20 Experiments Large candidate set of size ( V V 1 ) E Restrict based on maximum distance a new edge bridges Class imbalance Randomly leave out edges in training to get to 9 : 1 ratio Measure result using AUROC Determine difference between All features, Node features, Neighborhood Features and EFS BIPM Lecture 7: Network Analytics & Process Modelling Introduction 19 / 54
21 Results BIPM Lecture 7: Network Analytics & Process Modelling Introduction 20 / 54
22 Results Features digg fb-links fb-wall infectious liacs lkml slashdot topology ucsocial wikipedia All Node Neighbourhood Path EFS EFS Performance 99.4% 99.6% 98.8% 99.1% 99.8% 99.8% 99.2% 99.8% 99.7% 99.7% Table : AUROC for each network and each set of features. EFS Performance lists performance of EFS relative to All features. BIPM Lecture 7: Network Analytics & Process Modelling Introduction 21 / 54
23 Conclusions Network science treats data as an annotated set of objects and relationships The structure of the network provides new insights in the data Centrality measures are able to identify prominent actors in the network solely based on its structure Community detection algorithms reveal groups and clusters based on the network structure Link prediction is a form of predictive analytics in network data BIPM Lecture 7: Network Analytics & Process Modelling Introduction 22 / 54
24 Process Modelling BIPM Lecture 7: Network Analytics & Process Modelling Introduction 23 / 54
25 Recap Business Intelligence Process Modelling Business process modelling Modelling languages Process discovery Applications in financial industry BIPM Lecture 7: Network Analytics & Process Modelling Introduction 24 / 54
26 Business Process Management (recap) Process: a set of related actions and transactions to achieve a certain objective Business process: a sequence of activities aimed at producing something of value for the business (Morgan02) Management processes Operational processes Supporting processes Business Process Management: the discipline that combines knowledge from information technology and knowledge from management sciences and applies this to operational business processes (v.d. Aalst) Extension of WorkFlow Management (WFM) BIPM Lecture 7: Network Analytics & Process Modelling Introduction 25 / 54
27 Business Process Modelling (recap) Business Process Model: abstract representation of business processes, functionality is: Descriptive: what is actually happening? Prescriptive: what should be happening? Explanatory: why is the process designed this way? In practice: formalize and visualize business processes Process Discovery: derive the process from a description of activities Process Mining: the task of converting event data into process models (discovery, conformance, enhancement) BIPM Lecture 7: Network Analytics & Process Modelling Introduction 26 / 54
28 Why Model Processes? (recap) BIPM Lecture 7: Network Analytics & Process Modelling Introduction 27 / 54
29 Classical BPM Lifecycle (recap) BIPM Lecture 7: Network Analytics & Process Modelling Introduction 28 / 54
30 Process Mining (recap) BIPM Lecture 7: Network Analytics & Process Modelling Introduction 29 / 54
31 Business Process... Intelligence? M. Castellanos et al., Business process intelligence, Handbook of research on business process modeling, pp , BIPM Lecture 7: Network Analytics & Process Modelling Introduction 30 / 54
32 Process Modelling Informal models: used for discussion and documentation (process descriptions) Formal models: used for analysis or enactment Petri Nets today PN Business Process Model Notation later BPMN BIPM Lecture 7: Network Analytics & Process Modelling Introduction 31 / 54
33 Business Process Model Notation BIPM Lecture 7: Network Analytics & Process Modelling Introduction 32 / 54
34 Petri Nets BIPM Lecture 7: Network Analytics & Process Modelling Introduction 33 / 54
35 Event logs (1) Case ID Event ID dd-mm-yyyy:hh.mm Activity Resource Costs :11.02 register request Pete :10.06 examine thoroughly Sue :15.12 check ticket Mike :11.18 decide Sara :14.24 reject request Pete :11.32 register request Mike :12.12 check ticket Mike :14.16 examine casually Sean :11.22 decide Sara :12.05 pay compensation Ellen :14.32 register request Pete :15.06 examine casually Mike :16.34 check ticket Ellen :09.18 decide Sara :12.18 reinitiate request Sara :13.06 examine thoroughly Sean :11.43 check ticket Pete :09.55 decide Sara :10.45 pay compensation Ellen :15.02 register request Pete :12.06 check ticket Mike :14.43 examine thoroughly Sean :12.02 decide Sara :15.44 reject request Ellen Table : Event logs of a helpdesk handling customer compensations BIPM Lecture 7: Network Analytics & Process Modelling Introduction 34 / 54
36 Event logs (2) Case ID Event ID dd-mm-yyyy:hh.mm Activity Resource Costs :09.02 register request Ellen :10.16 examine casually Mike :11.22 check ticket Pete :13.28 decide Sara :16.18 reinitiate request Sara :14.33 check ticket Ellen :15.50 examine casually Mike :11.18 decide Sara :12.48 reinitiate request Sara :09.06 examine casually Sue :11.34 check ticket Pete :13.12 decide Sara :14.56 reject request Mike :15.02 register request Mike :16.06 examine casually Ellen :16.22 check ticket Mike :16.52 decide Sara :11.47 pay compensation Mike 200 Table : Event logs of a support desk handling customer compensations BIPM Lecture 7: Network Analytics & Process Modelling Introduction 35 / 54
37 Simplified event log Case ID Trace 1 a, b, d, e, h 2 a, d, c, e, g 3 a, c, d, e, f, b, d, e, g 4 a, d, b, e, h 5 a, c, d, e, f, d, c, e, f, c, d, e, h 6 a, c, d, e, g Table : Simplified event log of a support desk handling customer compensations (a = register request, b = examine thoroughly, c = examine casually, d = check ticket, e = decide, f = reinitiate request, g = pay compensation, h = reject request) BIPM Lecture 7: Network Analytics & Process Modelling Introduction 36 / 54
38 Simplified event log Case ID Trace 1 a, b, d, e, h 2 a, d, c, e, g 3 a, c, d, e, f, b, d, e, g 4 a, d, b, e, h 5 a, c, d, e, f, d, c, e, f, c, d, e, h 6 a, c, d, e, g Table : Simplified event log of a support desk handling customer compensations (a = register request, b = examine thoroughly, c = examine casually, d = check ticket, e = decide, f = reinitiate request, g = pay compensation, h = reject request) In short: { a, b, d, e, h, a, d, c, e, g, a, c, d, e, f, b, d, e, g, a, d, b, e, h, a, c, d, e, f, d, c, e, f, c, d, e, h, a, c, d, e, g } BIPM Lecture 7: Network Analytics & Process Modelling Introduction 36 / 54
39 Example (1) Case ID Trace 1 a, b, d, e, h 2 a, d, c, e, g 3 a, c, d, e, f, b, d, e, g 4 a, d, b, e, h 5 a, c, d, e, f, d, c, e, f, c, d, e, h 6 a, c, d, e, g BIPM Lecture 7: Network Analytics & Process Modelling Introduction 37 / 54
40 Example (2) Figure : Petri net based on event log { a, b, d, e, h, a, d, b, e, h } BIPM Lecture 7: Network Analytics & Process Modelling Introduction 38 / 54
41 Play in BIPM Lecture 7: Network Analytics & Process Modelling Introduction 39 / 54
42 Play out BIPM Lecture 7: Network Analytics & Process Modelling Introduction 40 / 54
43 Replay BIPM Lecture 7: Network Analytics & Process Modelling Introduction 41 / 54
44 Replay Connecting models to real events is crucial Possible uses Conformance checking Repairing models Extending the model with frequencies and temporal information Constructing predictive models Operational support (prediction, recommendation, etc.) BIPM Lecture 7: Network Analytics & Process Modelling Introduction 42 / 54
45 Petri Nets BIPM Lecture 7: Network Analytics & Process Modelling Introduction 43 / 54
46 Automata (remember?) Finite automaton FA = (Q, Σ, q o, A, δ) Q is a finite set of states Σ is a finite alphabet of input symbols q o Q is the initial state A Q is the set of accepting states δ : Q Σ Q is the transition function BIPM Lecture 7: Network Analytics & Process Modelling Introduction 44 / 54
47 Automata (remember?) Finite automaton FA = (Q, Σ, q o, A, δ) Q is a finite set of states Σ is a finite alphabet of input symbols q o Q is the initial state A Q is the set of accepting states δ : Q Σ Q is the transition function Figure : Deterministic Finite Automaton for the function x mod 3 BIPM Lecture 7: Network Analytics & Process Modelling Introduction 44 / 54
48 Petri Nets Petri net N = (P, T, F ) P is a finite set of places T is a finite set of transitions F (P T ) (T P) is a finite set of directed arcs called the flow relation BIPM Lecture 7: Network Analytics & Process Modelling Introduction 45 / 54
49 Labeled Petri Nets Petri net N = (P, T, F, A, l) P is a finite set of places T is a finite set of transitions F (P T ) (T P) is a finite set of directed arcs called the flow relation A is a set of activity labels l : T A is a labeling function BIPM Lecture 7: Network Analytics & Process Modelling Introduction 46 / 54
50 Enabling A transition is enabled if each of its input places contains at least one token BIPM Lecture 7: Network Analytics & Process Modelling Introduction 47 / 54
51 Firing An enabled transition can fire (i.e., it occurs), consuming a token from each input place and producing a token for each output place. BIPM Lecture 7: Network Analytics & Process Modelling Introduction 48 / 54
52 Petri Nets Connections are directed No connections between two places or two transitions Places may hold zero or more tokens At most one arc between nodes (for now) Firing is atomic Multiple transitions may be enabled, but only one fires at a time During execution, the number of tokens may vary if there are transitions for which the number of input places is not equal to the number of output places The network is static BIPM Lecture 7: Network Analytics & Process Modelling Introduction 49 / 54
53 Example (1) Petri net for a traffic light BIPM Lecture 7: Network Analytics & Process Modelling Introduction 50 / 54
54 Example (1) Petri net for a traffic light States: red, orange and green BIPM Lecture 7: Network Analytics & Process Modelling Introduction 50 / 54
55 Example (1) Petri net for a traffic light States: red, orange and green Transitions from red to green, green to orange, and orange to red BIPM Lecture 7: Network Analytics & Process Modelling Introduction 50 / 54
56 Example (1) Petri net for a traffic light States: red, orange and green Transitions from red to green, green to orange, and orange to red BIPM Lecture 7: Network Analytics & Process Modelling Introduction 50 / 54
57 Example (2) Petri net for 2 traffic lights BIPM Lecture 7: Network Analytics & Process Modelling Introduction 51 / 54
58 Example (2) Petri net for 2 traffic lights BIPM Lecture 7: Network Analytics & Process Modelling Introduction 51 / 54
59 Example (3) Petri net for 2 traffic lights BIPM Lecture 7: Network Analytics & Process Modelling Introduction 52 / 54
60 Lab session Continue with Assignment 2 Do the pandas, scikit-learn and Algorithmia tutorials Create features Machine learning Implement (a small part of) your data mining algorithm on Algorithmia, and add it to your dashboard Write the (scientific!) report for the assignment Start reading relevant book chapters... BIPM Lecture 7: Network Analytics & Process Modelling Introduction 53 / 54
61 Credits Lecture based on slides belonging to the course book W. van der Aalst, Process Mining: Discovery, Conformance and Enhancement of Business Processes, Springer, BIPM Lecture 7: Network Analytics & Process Modelling Introduction 54 / 54
Using Process Mining to Bridge the Gap between BI and BPM
Using Process Mining to Bridge the Gap between BI and BPM Wil van der alst Eindhoven University of Technology, The Netherlands Process mining techniques enable process-centric analytics through automated
More informationProcess Modelling from Insurance Event Log
Process Modelling from Insurance Event Log P.V. Kumaraguru Research scholar, Dr.M.G.R Educational and Research Institute University Chennai- 600 095 India Dr. S.P. Rajagopalan Professor Emeritus, Dr. M.G.R
More informationBusiness Process Modeling
Business Process Concepts Process Mining Kelly Rosa Braghetto Instituto de Matemática e Estatística Universidade de São Paulo kellyrb@ime.usp.br January 30, 2009 1 / 41 Business Process Concepts Process
More informationProcess Mining Data Science in Action
Process Mining Data Science in Action Wil van der Aalst Scientific director of the DSC/e Dutch Data Science Summit, Eindhoven, 4-5-2014. Process Mining Data Science in Action https://www.coursera.org/course/procmin
More informationSocial Network Mining
Social Network Mining Data Mining November 11, 2013 Frank Takes (ftakes@liacs.nl) LIACS, Universiteit Leiden Overview Social Network Analysis Graph Mining Online Social Networks Friendship Graph Semantics
More informationModel Discovery from Motor Claim Process Using Process Mining Technique
International Journal of Scientific and Research Publications, Volume 3, Issue 1, January 2013 1 Model Discovery from Motor Claim Process Using Process Mining Technique P.V.Kumaraguru *, Dr.S.P.Rajagopalan
More informationData Science. Research Theme: Process Mining
Data Science Research Theme: Process Mining Process mining is a relatively young research discipline that sits between computational intelligence and data mining on the one hand and process modeling and
More informationDistance Degree Sequences for Network Analysis
Universität Konstanz Computer & Information Science Algorithmics Group 15 Mar 2005 based on Palmer, Gibbons, and Faloutsos: ANF A Fast and Scalable Tool for Data Mining in Massive Graphs, SIGKDD 02. Motivation
More informationProcess Mining The influence of big data (and the internet of things) on the supply chain
September 16, 2015 Process Mining The influence of big data (and the internet of things) on the supply chain Wil van der Aalst www.vdaalst.com @wvdaalst www.processmining.org http://www.engineersjournal.ie/factory-of-thefuture-will-see-merging-of-virtual-and-real-worlds/
More informationLluis Belanche + Alfredo Vellido. Intelligent Data Analysis and Data Mining. Data Analysis and Knowledge Discovery
Lluis Belanche + Alfredo Vellido Intelligent Data Analysis and Data Mining or Data Analysis and Knowledge Discovery a.k.a. Data Mining II An insider s view Geoff Holmes: WEKA founder Process Mining
More informationProcess Mining. ^J Springer. Discovery, Conformance and Enhancement of Business Processes. Wil M.R van der Aalst Q UNIVERS1TAT.
Wil M.R van der Aalst Process Mining Discovery, Conformance and Enhancement of Business Processes Q UNIVERS1TAT m LIECHTENSTEIN Bibliothek ^J Springer Contents 1 Introduction I 1.1 Data Explosion I 1.2
More informationModelling Workflow with Petri Nets. CA4 BPM PetriNets
Modelling Workflow with Petri Nets 1 Workflow Management Issues Georgakopoulos,Hornick, Sheth Process Workflow specification Workflow Implementation =workflow application Business Process Modelling/ Reengineering
More informationProcess Mining Using BPMN: Relating Event Logs and Process Models
Noname manuscript No. (will be inserted by the editor) Process Mining Using BPMN: Relating Event Logs and Process Models Anna A. Kalenkova W. M. P. van der Aalst Irina A. Lomazova Vladimir A. Rubin Received:
More informationAsking Hard Graph Questions. Paul Burkhardt. February 3, 2014
Beyond Watson: Predictive Analytics and Big Data U.S. National Security Agency Research Directorate - R6 Technical Report February 3, 2014 300 years before Watson there was Euler! The first (Jeopardy!)
More informationChapter 4 Getting the Data
Chapter 4 Getting the Data prof.dr.ir. Wil van der Aalst www.processmining.org Overview Chapter 1 Introduction Part I: Preliminaries Chapter 2 Process Modeling and Analysis Chapter 3 Data Mining Part II:
More informationBig Data Analytics of Multi-Relationship Online Social Network Based on Multi-Subnet Composited Complex Network
, pp.273-284 http://dx.doi.org/10.14257/ijdta.2015.8.5.24 Big Data Analytics of Multi-Relationship Online Social Network Based on Multi-Subnet Composited Complex Network Gengxin Sun 1, Sheng Bin 2 and
More informationSocial Media Mining. Graph Essentials
Graph Essentials Graph Basics Measures Graph and Essentials Metrics 2 2 Nodes and Edges A network is a graph nodes, actors, or vertices (plural of vertex) Connections, edges or ties Edge Node Measures
More information1. Introduction Gene regulation Genomics and genome analyses Hidden markov model (HMM)
1. Introduction Gene regulation Genomics and genome analyses Hidden markov model (HMM) 2. Gene regulation tools and methods Regulatory sequences and motif discovery TF binding sites, microrna target prediction
More informationProcess Mining: Making Knowledge Discovery Process Centric
Process Mining: Making Knowledge Discovery Process Centric Wil van der alst Department of Mathematics and Computer Science Eindhoven University of Technology PO Box 513, 5600 MB, Eindhoven, The Netherlands
More informationExtracting Information from Social Networks
Extracting Information from Social Networks Aggregating site information to get trends 1 Not limited to social networks Examples Google search logs: flu outbreaks We Feel Fine Bullying 2 Bullying Xu, Jun,
More informationA discussion of Statistical Mechanics of Complex Networks P. Part I
A discussion of Statistical Mechanics of Complex Networks Part I Review of Modern Physics, Vol. 74, 2002 Small Word Networks Clustering Coefficient Scale-Free Networks Erdös-Rényi model cover only parts
More informationStrong and Weak Ties
Strong and Weak Ties Web Science (VU) (707.000) Elisabeth Lex KTI, TU Graz April 11, 2016 Elisabeth Lex (KTI, TU Graz) Networks April 11, 2016 1 / 66 Outline 1 Repetition 2 Strong and Weak Ties 3 General
More informationTuring Machines: An Introduction
CIT 596 Theory of Computation 1 We have seen several abstract models of computing devices: Deterministic Finite Automata, Nondeterministic Finite Automata, Nondeterministic Finite Automata with ɛ-transitions,
More informationProcess Mining and Visual Analytics: Breathing Life into Business Process Models
Process Mining and Visual Analytics: Breathing Life into Business Process Models Wil M.P. van der Aalst 1, Massimiliano de Leoni 1, and Arthur H.M. ter Hofstede 1,2 1 Eindhoven University of Technology,
More informationFormal Languages and Automata Theory - Regular Expressions and Finite Automata -
Formal Languages and Automata Theory - Regular Expressions and Finite Automata - Samarjit Chakraborty Computer Engineering and Networks Laboratory Swiss Federal Institute of Technology (ETH) Zürich March
More informationChapter 29 Scale-Free Network Topologies with Clustering Similar to Online Social Networks
Chapter 29 Scale-Free Network Topologies with Clustering Similar to Online Social Networks Imre Varga Abstract In this paper I propose a novel method to model real online social networks where the growing
More informationGraph Mining and Social Network Analysis
Graph Mining and Social Network Analysis Data Mining and Text Mining (UIC 583 @ Politecnico di Milano) References Jiawei Han and Micheline Kamber, "Data Mining: Concepts and Techniques", The Morgan Kaufmann
More informationNetwork Analysis For Sustainability Management
Network Analysis For Sustainability Management 1 Cátia Vaz 1º Summer Course in E4SD Outline Motivation Networks representation Structural network analysis Behavior network analysis 2 Networks Over the
More informationSocial Media Mining. Data Mining Essentials
Introduction Data production rate has been increased dramatically (Big Data) and we are able store much more data than before E.g., purchase data, social media data, mobile phone data Businesses and customers
More informationPractical Graph Mining with R. 5. Link Analysis
Practical Graph Mining with R 5. Link Analysis Outline Link Analysis Concepts Metrics for Analyzing Networks PageRank HITS Link Prediction 2 Link Analysis Concepts Link A relationship between two entities
More informationCOMP3420: Advanced Databases and Data Mining. Classification and prediction: Introduction and Decision Tree Induction
COMP3420: Advanced Databases and Data Mining Classification and prediction: Introduction and Decision Tree Induction Lecture outline Classification versus prediction Classification A two step process Supervised
More information6.045: Automata, Computability, and Complexity Or, Great Ideas in Theoretical Computer Science Spring, 2010. Class 4 Nancy Lynch
6.045: Automata, Computability, and Complexity Or, Great Ideas in Theoretical Computer Science Spring, 2010 Class 4 Nancy Lynch Today Two more models of computation: Nondeterministic Finite Automata (NFAs)
More informationIntroduction to Finite Automata
Introduction to Finite Automata Our First Machine Model Captain Pedro Ortiz Department of Computer Science United States Naval Academy SI-340 Theory of Computing Fall 2012 Captain Pedro Ortiz (US Naval
More informationCHAPTER 1 INTRODUCTION
CHAPTER 1 INTRODUCTION 1.1 Research Motivation In today s modern digital environment with or without our notice we are leaving our digital footprints in various data repositories through our daily activities,
More informationHow To Understand The Network Of A Network
Roles in Networks Roles in Networks Motivation for work: Let topology define network roles. Work by Kleinberg on directed graphs, used topology to define two types of roles: authorities and hubs. (Each
More informationProM 6 Exercises. J.C.A.M. (Joos) Buijs and J.J.C.L. (Jan) Vogelaar {j.c.a.m.buijs,j.j.c.l.vogelaar}@tue.nl. August 2010
ProM 6 Exercises J.C.A.M. (Joos) Buijs and J.J.C.L. (Jan) Vogelaar {j.c.a.m.buijs,j.j.c.l.vogelaar}@tue.nl August 2010 The exercises provided in this section are meant to become more familiar with ProM
More informationSocial Network Analysis
Social Network Analysis Challenges in Computer Science April 1, 2014 Frank Takes (ftakes@liacs.nl) LIACS, Leiden University Overview Context Social Network Analysis Online Social Networks Friendship Graph
More informationIntroduction to Networks and Business Intelligence
Introduction to Networks and Business Intelligence Prof. Dr. Daning Hu Department of Informatics University of Zurich Sep 17th, 2015 Outline Network Science A Random History Network Analysis Network Topological
More informationDotted Chart and Control-Flow Analysis for a Loan Application Process
Dotted Chart and Control-Flow Analysis for a Loan Application Process Thomas Molka 1,2, Wasif Gilani 1 and Xiao-Jun Zeng 2 Business Intelligence Practice, SAP Research, Belfast, UK The University of Manchester,
More informationAnalysis of Service Level Agreements using Process Mining techniques
Analysis of Service Level Agreements using Process Mining techniques CHRISTIAN MAGER University of Applied Sciences Wuerzburg-Schweinfurt Process Mining offers powerful methods to extract knowledge from
More informationWeb Document Clustering
Web Document Clustering Lab Project based on the MDL clustering suite http://www.cs.ccsu.edu/~markov/mdlclustering/ Zdravko Markov Computer Science Department Central Connecticut State University New Britain,
More informationGenetic programming with regular expressions
Genetic programming with regular expressions Børge Svingen Chief Technology Officer, Open AdExchange bsvingen@openadex.com 2009-03-23 Pattern discovery Pattern discovery: Recognizing patterns that characterize
More informationSocial Media Mining. Network Measures
Klout Measures and Metrics 22 Why Do We Need Measures? Who are the central figures (influential individuals) in the network? What interaction patterns are common in friends? Who are the like-minded users
More informationProtein Protein Interaction Networks
Functional Pattern Mining from Genome Scale Protein Protein Interaction Networks Young-Rae Cho, Ph.D. Assistant Professor Department of Computer Science Baylor University it My Definition of Bioinformatics
More informationSoSe 2014: M-TANI: Big Data Analytics
SoSe 2014: M-TANI: Big Data Analytics Lecture 4 21/05/2014 Sead Izberovic Dr. Nikolaos Korfiatis Agenda Recap from the previous session Clustering Introduction Distance mesures Hierarchical Clustering
More informationRegular Languages and Finite State Machines
Regular Languages and Finite State Machines Plan for the Day: Mathematical preliminaries - some review One application formal definition of finite automata Examples 1 Sets A set is an unordered collection
More informationBusiness Intelligence and Process Modelling
Business Intelligence and Process Modelling F.W. Takes Universiteit Leiden Lecture 2: Business Intelligence & Visual Analytics BIPM Lecture 2: Business Intelligence & Visual Analytics 1 / 72 Business Intelligence
More informationWhite Paper BPMN 2.0 Task Types Explained
White Paper BPMN 2.0 Task Types Explained WP0093 August 2013 Tasks represent the most fundamental process elements, which define units of work in a process. In BPMN, a Task represents an atomic Activity
More informationHIGH PERFORMANCE BIG DATA ANALYTICS
HIGH PERFORMANCE BIG DATA ANALYTICS Kunle Olukotun Electrical Engineering and Computer Science Stanford University June 2, 2014 Explosion of Data Sources Sensors DoD is swimming in sensors and drowning
More informationBIS 3106: Business Process Management. Lecture Two: Modelling the Control-flow Perspective
BIS 3106: Business Process Management Lecture Two: Modelling the Control-flow Perspective Makerere University School of Computing and Informatics Technology Department of Computer Science SEM I 2015/2016
More informationClassification and Prediction
Classification and Prediction Slides for Data Mining: Concepts and Techniques Chapter 7 Jiawei Han and Micheline Kamber Intelligent Database Systems Research Lab School of Computing Science Simon Fraser
More informationUsing Trace Clustering for Configurable Process Discovery Explained by Event Log Data
Master of Business Information Systems, Department of Mathematics and Computer Science Using Trace Clustering for Configurable Process Discovery Explained by Event Log Data Master Thesis Author: ing. Y.P.J.M.
More informationThe Goldberg Rao Algorithm for the Maximum Flow Problem
The Goldberg Rao Algorithm for the Maximum Flow Problem COS 528 class notes October 18, 2006 Scribe: Dávid Papp Main idea: use of the blocking flow paradigm to achieve essentially O(min{m 2/3, n 1/2 }
More informationD A T A M I N I N G C L A S S I F I C A T I O N
D A T A M I N I N G C L A S S I F I C A T I O N FABRICIO VOZNIKA LEO NARDO VIA NA INTRODUCTION Nowadays there is huge amount of data being collected and stored in databases everywhere across the globe.
More informationInvestigating Clinical Care Pathways Correlated with Outcomes
Investigating Clinical Care Pathways Correlated with Outcomes Geetika T. Lakshmanan, Szabolcs Rozsnyai, Fei Wang IBM T. J. Watson Research Center, NY, USA August 2013 Outline Care Pathways Typical Challenges
More informationWhy? A central concept in Computer Science. Algorithms are ubiquitous.
Analysis of Algorithms: A Brief Introduction Why? A central concept in Computer Science. Algorithms are ubiquitous. Using the Internet (sending email, transferring files, use of search engines, online
More informationMINFS544: Business Network Data Analytics and Applications
MINFS544: Business Network Data Analytics and Applications March 30 th, 2015 Daning Hu, Ph.D., Department of Informatics University of Zurich F Schweitzer et al. Science 2009 Stop Contagious Failures in
More informationSome questions... Graphs
Uni Innsbruck Informatik - 1 Uni Innsbruck Informatik - 2 Some questions... Peer-to to-peer Systems Analysis of unstructured P2P systems How scalable is Gnutella? How robust is Gnutella? Why does FreeNet
More informationBPIC 2014: Insights from the Analysis of Rabobank Service Desk Processes
BPIC 2014: Insights from the Analysis of Rabobank Service Desk Processes Bruna Christina P. Brandão, Guilherme Neves Lopes, Pedro Henrique P. Richetti Department of Applied Informatics - Federal University
More informationSummary and Outlook. Business Process Intelligence Course Lecture 8. prof.dr.ir. Wil van der Aalst. www.processmining.org
Business Process Intelligence Course Lecture 8 Summary and Outlook prof.dr.ir. Wil van der Aalst www.processmining.org Overview Chapter 1 Introduction Part I: Preliminaries Chapter 2 Process Modeling and
More informationVisualization methods for patent data
Visualization methods for patent data Treparel 2013 Dr. Anton Heijs (CTO & Founder) Delft, The Netherlands Introduction Treparel can provide advanced visualizations for patent data. This document describes
More informationBig Data Mining Services and Knowledge Discovery Applications on Clouds
Big Data Mining Services and Knowledge Discovery Applications on Clouds Domenico Talia DIMES, Università della Calabria & DtoK Lab Italy talia@dimes.unical.it Data Availability or Data Deluge? Some decades
More informationGenetic Algorithm Evolution of Cellular Automata Rules for Complex Binary Sequence Prediction
Brill Academic Publishers P.O. Box 9000, 2300 PA Leiden, The Netherlands Lecture Series on Computer and Computational Sciences Volume 1, 2005, pp. 1-6 Genetic Algorithm Evolution of Cellular Automata Rules
More informationDynamic Network Analyzer Building a Framework for the Graph-theoretic Analysis of Dynamic Networks
Dynamic Network Analyzer Building a Framework for the Graph-theoretic Analysis of Dynamic Networks Benjamin Schiller and Thorsten Strufe P2P Networks - TU Darmstadt [schiller, strufe][at]cs.tu-darmstadt.de
More informationA comparative study of social network analysis tools
Membre de Membre de A comparative study of social network analysis tools David Combe, Christine Largeron, Előd Egyed-Zsigmond and Mathias Géry International Workshop on Web Intelligence and Virtual Enterprises
More informationReading 13 : Finite State Automata and Regular Expressions
CS/Math 24: Introduction to Discrete Mathematics Fall 25 Reading 3 : Finite State Automata and Regular Expressions Instructors: Beck Hasti, Gautam Prakriya In this reading we study a mathematical model
More informationGraph Theory and Complex Networks: An Introduction. Chapter 06: Network analysis. Contents. Introduction. Maarten van Steen. Version: April 28, 2014
Graph Theory and Complex Networks: An Introduction Maarten van Steen VU Amsterdam, Dept. Computer Science Room R.0, steen@cs.vu.nl Chapter 0: Version: April 8, 0 / Contents Chapter Description 0: Introduction
More informationPart 2: Community Detection
Chapter 8: Graph Data Part 2: Community Detection Based on Leskovec, Rajaraman, Ullman 2014: Mining of Massive Datasets Big Data Management and Analytics Outline Community Detection - Social networks -
More informationCluster detection algorithm in neural networks
Cluster detection algorithm in neural networks David Meunier and Hélène Paugam-Moisy Institute for Cognitive Science, UMR CNRS 5015 67, boulevard Pinel F-69675 BRON - France E-mail: {dmeunier,hpaugam}@isc.cnrs.fr
More informationComplex Networks Analysis: Clustering Methods
Complex Networks Analysis: Clustering Methods Nikolai Nefedov Spring 2013 ISI ETH Zurich nefedov@isi.ee.ethz.ch 1 Outline Purpose to give an overview of modern graph-clustering methods and their applications
More informationProcess Mining and Network Analysis
Towards Comprehensive Support for Organizational Mining Minseok Song and Wil M.P. van der Aalst Eindhoven University of Technology P.O.Box 513, NL-5600 MB, Eindhoven, The Netherlands. {m.s.song, w.m.p.v.d.aalst}@tue.nl
More informationGraph Theory and Complex Networks: An Introduction. Chapter 06: Network analysis
Graph Theory and Complex Networks: An Introduction Maarten van Steen VU Amsterdam, Dept. Computer Science Room R4.0, steen@cs.vu.nl Chapter 06: Network analysis Version: April 8, 04 / 3 Contents Chapter
More informationTitle: Basic Concepts and Technologies for Business Process Management
Title: Basic Concepts and Technologies for Business Process Management Presenter: prof.dr. Manfred Reichert The economic success of an enterprise more and more depends on its ability to flexibly and quickly
More informationFeature. Applications of Business Process Analytics and Mining for Internal Control. World
Feature Filip Caron is a doctoral researcher in the Department of Decision Sciences and Information Management, Information Systems Group, at the Katholieke Universiteit Leuven (Flanders, Belgium). Jan
More informationData Science Center Eindhoven. Big Data: Challenges and Opportunities for Mathematicians. Alessandro Di Bucchianico
Data Science Center Eindhoven Big Data: Challenges and Opportunities for Mathematicians Alessandro Di Bucchianico Dutch Mathematical Congress April 15, 2015 Contents 1. Big Data terminology 2. Various
More informationFast Contextual Preference Scoring of Database Tuples
Fast Contextual Preference Scoring of Database Tuples Kostas Stefanidis Department of Computer Science, University of Ioannina, Greece Joint work with Evaggelia Pitoura http://dmod.cs.uoi.gr 2 Motivation
More informationGeneral Network Analysis: Graph-theoretic. COMP572 Fall 2009
General Network Analysis: Graph-theoretic Techniques COMP572 Fall 2009 Networks (aka Graphs) A network is a set of vertices, or nodes, and edges that connect pairs of vertices Example: a network with 5
More informationComplex Network Visualization based on Voronoi Diagram and Smoothed-particle Hydrodynamics
Complex Network Visualization based on Voronoi Diagram and Smoothed-particle Hydrodynamics Zhao Wenbin 1, Zhao Zhengxu 2 1 School of Instrument Science and Engineering, Southeast University, Nanjing, Jiangsu
More informationIntelligent Process Management & Process Visualization. TAProViz 2014 workshop. Presenter: Dafna Levy
Intelligent Process Management & Process Visualization TAProViz 2014 workshop Presenter: Dafna Levy The Topics Process Visualization in Priority ERP Planning Execution BI analysis (Built-in) Discovering
More informationImplementing Heuristic Miner for Different Types of Event Logs
Implementing Heuristic Miner for Different Types of Event Logs Angelina Prima Kurniati 1, GunturPrabawa Kusuma 2, GedeAgungAry Wisudiawan 3 1,3 School of Compuing, Telkom University, Indonesia. 2 School
More informationPLG: a Framework for the Generation of Business Process Models and their Execution Logs
PLG: a Framework for the Generation of Business Process Models and their Execution Logs Andrea Burattin and Alessandro Sperduti Department of Pure and Applied Mathematics University of Padua, Italy {burattin,sperduti}@math.unipd.it
More informationIn this presentation, you will be introduced to data mining and the relationship with meaningful use.
In this presentation, you will be introduced to data mining and the relationship with meaningful use. Data mining refers to the art and science of intelligent data analysis. It is the application of machine
More informationGraph Theory and Complex Networks: An Introduction. Chapter 08: Computer networks
Graph Theory and Complex Networks: An Introduction Maarten van Steen VU Amsterdam, Dept. Computer Science Room R4.20, steen@cs.vu.nl Chapter 08: Computer networks Version: March 3, 2011 2 / 53 Contents
More informationDescribe the process of parallelization as it relates to problem solving.
Level 2 (recommended for grades 6 9) Computer Science and Community Middle school/junior high school students begin using computational thinking as a problem-solving tool. They begin to appreciate the
More informationData Mining on Social Networks. Dionysios Sotiropoulos Ph.D.
Data Mining on Social Networks Dionysios Sotiropoulos Ph.D. 1 Contents What are Social Media? Mathematical Representation of Social Networks Fundamental Data Mining Concepts Data Mining Tasks on Digital
More informationMEng, BSc Computer Science with Artificial Intelligence
School of Computing FACULTY OF ENGINEERING MEng, BSc Computer Science with Artificial Intelligence Year 1 COMP1212 Computer Processor Effective programming depends on understanding not only how to give
More informationData Science Betere processen en producten dankzij (Big) data. Wil van der Aalst www.vdaalst.com @wvdaalst www.processmining.org
Data Science Betere processen en producten dankzij (Big) data Wil van der Aalst www.vdaalst.com @wvdaalst www.processmining.org Data Science Center Eindhoven http://www.tue.nl/dsce/ DSC/e: Competences
More informationDmitri Krioukov CAIDA/UCSD
Hyperbolic geometry of complex networks Dmitri Krioukov CAIDA/UCSD dima@caida.org F. Papadopoulos, M. Boguñá, A. Vahdat, and kc claffy Complex networks Technological Internet Transportation Power grid
More informationNotes on Complexity Theory Last updated: August, 2011. Lecture 1
Notes on Complexity Theory Last updated: August, 2011 Jonathan Katz Lecture 1 1 Turing Machines I assume that most students have encountered Turing machines before. (Students who have not may want to look
More information14.10.2014. Overview. Swarms in nature. Fish, birds, ants, termites, Introduction to swarm intelligence principles Particle Swarm Optimization (PSO)
Overview Kyrre Glette kyrrehg@ifi INF3490 Swarm Intelligence Particle Swarm Optimization Introduction to swarm intelligence principles Particle Swarm Optimization (PSO) 3 Swarms in nature Fish, birds,
More informationChapter 2 Introduction to Business Processes, BPM, and BPM Systems
Chapter 2 Introduction to Business Processes, BPM, and BPM Systems This chapter provides a basic overview on business processes. In particular it concentrates on the actual definition and characterization
More informationOption 1: empirical network analysis. Task: find data, analyze data (and visualize it), then interpret.
Programming project Task Option 1: empirical network analysis. Task: find data, analyze data (and visualize it), then interpret. Obtaining data This project focuses upon cocktail ingredients. Data was
More informationInformatique Fondamentale IMA S8
Informatique Fondamentale IMA S8 Cours 1 - Intro + schedule + finite state machines Laure Gonnord http://laure.gonnord.org/pro/teaching/ Laure.Gonnord@polytech-lille.fr Université Lille 1 - Polytech Lille
More informationProcess Mining by Measuring Process Block Similarity
Process Mining by Measuring Process Block Similarity Joonsoo Bae, James Caverlee 2, Ling Liu 2, Bill Rouse 2, Hua Yan 2 Dept of Industrial & Sys Eng, Chonbuk National Univ, South Korea jsbae@chonbukackr
More informationMedical Information Management & Mining. You Chen Jan,15, 2013 You.chen@vanderbilt.edu
Medical Information Management & Mining You Chen Jan,15, 2013 You.chen@vanderbilt.edu 1 Trees Building Materials Trees cannot be used to build a house directly. How can we transform trees to building materials?
More informationDistributed Computing over Communication Networks: Topology. (with an excursion to P2P)
Distributed Computing over Communication Networks: Topology (with an excursion to P2P) Some administrative comments... There will be a Skript for this part of the lecture. (Same as slides, except for today...
More informationA SOCIAL NETWORK ANALYSIS APPROACH TO ANALYZE ROAD NETWORKS INTRODUCTION
A SOCIAL NETWORK ANALYSIS APPROACH TO ANALYZE ROAD NETWORKS Kyoungjin Park Alper Yilmaz Photogrammetric and Computer Vision Lab Ohio State University park.764@osu.edu yilmaz.15@osu.edu ABSTRACT Depending
More informationLecture 2: Universality
CS 710: Complexity Theory 1/21/2010 Lecture 2: Universality Instructor: Dieter van Melkebeek Scribe: Tyson Williams In this lecture, we introduce the notion of a universal machine, develop efficient universal
More informationGraph theoretic approach to analyze amino acid network
Int. J. Adv. Appl. Math. and Mech. 2(3) (2015) 31-37 (ISSN: 2347-2529) Journal homepage: www.ijaamm.com International Journal of Advances in Applied Mathematics and Mechanics Graph theoretic approach to
More informationANALYTICS STRATEGY: creating a roadmap for success
ANALYTICS STRATEGY: creating a roadmap for success Companies in the capital and commodity markets are looking at analytics for opportunities to improve revenue and cost savings. Yet, many firms are struggling
More information