The Application of Association Rule Mining in CRM Based on Formal Concept Analysis

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "The Application of Association Rule Mining in CRM Based on Formal Concept Analysis"

Transcription

1 The Application of Association Rule Mining in CRM Based on Formal Concept Analysis HongSheng Xu * and Lan Wang College of Information Technology, Luoyang Normal University, Luoyang, , China Abstract. CRM (Customer Relationship Management) is to select and manage valuable customer relationships and a business strategy, CRM requires a customer-centric corporate culture to support effective marketing, sales and service processes. As a branch of applied mathematics, FCA (formal concept analysis) comes of the understanding of concept in philosophical domain. This paper presents the application of association rule mining in CRM based on formal concept analysis. Experiments show that the proposed algorithm in the CRM more effective than the traditional algorithm. Keywords: Formal concept analysis, CRM, association rule mining. 1 Introduction Customer Relationship Management of the implication is that through the details of clients in-depth analysis, to improve customer satisfaction, thereby enhancing the competitiveness of enterprises as a means of it [1]. CRM (Customer Relationship Management) that is customer relationship management. Literally, is an enterprise with the CRM to manage customer relationships? In different contexts, CRM may be a management academic language, may be a software system, and are usually referred to CRM, is a computer automated analysis of sales, marketing, customer service and application support processes of the software system. Its goal is to reduce the sales cycle and marketing costs, increase revenue, expand their business needs and new markets channels and enhance customer value, satisfaction, profitability and loyalty. CRM is to select and manage valuable customer relationships and a business strategy, CRM requires a customer-centric corporate culture to support effective marketing, sales and service processes. As a branch of applied mathematics, FCA (formal concept analysis) comes of the understanding of concept in philosophical domain. It is to describe the concept in formalization of symbol from extent and intent, and then realize the semantic information which can be understood by computer. It is to extract all connotative concepts and connections between them from formal context according to the binary relationship so as to form a hierarchical structure of concept. Concept lattice in formal concept analysis as the core data structures, in essence, describes the link between * Author Introduce: Xu HongSheng(1979-), Male, lecturer, Master, College of Information Technology, Luoyang Normal University, Research area: Data mining, CRM. D. Jin and S. Lin (Eds.): Advances in CSIE, Vol. 2, AISC 169, pp springerlink.com Springer-Verlag Berlin Heidelberg 2012

2 28 H. Xu and L. Wang objects and features, indicating generalization between the concepts of relationship with patients, the corresponding Hasse diagram is the visual realization of the data of it. In the data mining study, found that the rule has become a central issue. This paper first introduces the concept of a classical lattice-based algorithm for extracting implication rules, the incremental algorithm to build grid, and update the rule set, we needed on the grid structure modified accordingly, so you can get frequent incremental itemsets. This article describes the basic theory of association rule mining knowledge. This paper proposes the association rule mining in CRM using formal concept analysis. The algorithm is based on two concepts removed conjunct implies the rule set as input, the rule set according to their content to be divided, the division will focus on a rule one by one into the other rule set, and thus get the final merged result. 2 The Research of Association Rule Mining Based on Formal Concept Analysis Concept lattice model is the product of introduction and lattice theory combined with practical application, here is some of the basic definitions of introduction and lattice theory. Formal Concept Analysis is a philosophical concept of a mathematical process in which people organize and analyze data in a way, is the data and its structure, nature and visualize dependencies for a description. In formal concept analysis, the concept is to understand the grounds of extension and intension of two parts. Refers to the concept of extension of this concept is the set of all objects, meaning it refers to all characteristics common to these objects (or attributes) set [2]. Concept lattice in formal concept analysis as the core data structures, in essence, describes the link between objects and features, indicating generalization between the concepts of relationship with patients, the corresponding Hasse diagram is the visual realization of the data, vivid and concise reflection of the generalization relationship between these concepts. Therefore, the concept lattice is considered to be a powerful tool for data analysis. Order theory and lattice theory as a practical application combined with a product concept lattice model study has important theoretical significance. A formal context (formal context) is a triple K = (G, M, I), where G is a collection of objects, M is the set of attributes, I G and M is a binary relation between, the I G M. gim that g G and m M there is a relationship between I, read as an object g has attribute m, is shown by equation 1. O G: f( O ) = { m x O ( xim)} M 1 M : g( M 1) = { x d M 1( xid)} If (M, ) is a partial order set, a, b, c and d are the elements of M and b < c. Then set[b, c] : = {x M b x c } called interval (interval), collection (a] : = {x M x a } called principal ideal (principal ideal), set [d) : = {x M x d } called (1)

3 The Application of Association Rule Mining in CRM Based on Formal Concept Analysis 29 principal sub filter (principal filter). Besides, a b a<b and [a, b]={a, b}, is shown by equation 2. t T A t = A t t T Set (A, ) is a partial order set, if for any the unempty set S A, there exists S, (A, ) is called a full merger half lattice. Similarly, if for any the unempty set S A, there exists S, (A, ) is called a full cross half lattice. If (A, ) is a full merger half lattice and also a full cross half lattice, it is a full lattice. The two mapping is called Galois connection between the power set of A and the power set of B. binary group (A1, B1) P (A) x P (B), if meet the A1 = g (B1) and B1 = f (A1), then is called a formal concept of formal context C, A1 called denotation, B1 called connotation, all the formal concept sets of C writes down as F(C), as is shown by equation 3. ({ g G ~ γg x}{, m M x ~ μ }), ψx : = m The progressive construction concept lattice is under the given original formal context K = (X, D, R) corresponding to the original concept lattice L and new object X * situation, solving formal context K * = (X {X *}, D, R) corresponding to the concept lattice L *. Given formal context K = (G, M, I), if formal context K 1 = (G 1, M 1,I 1 ) and K 2 = (G 2, M 2, I 2 ) meet the G 1 G, G 2 G, M 1 M, M 2 M, then says K 1 and K 2 is the same domain formal context, they are all the son formal contexts of K, also says the concept lattice L (K 1 ) of formal context K 1 and the concept lattice L (K 2 ) of formal K 2 are the same domain concept lattice. The similarity is calculated as follows equation 4. B ( ( )) ( GMI) B GM { M} I G ( M { M} ),,, \, \. For the formal contexts K1 = (G,M 1, I 1 ) and K 2 = (G, M 2, I 2 ) of the same object domain, if M 1 M, M 2 M, M 1 M 2 =, then says K 1 and K 2, L (K 1 ) and L (K 2 ) were connotation independent; If M 1 M, M 2 M, M 1 M 2, for any g G and arbitrary m M 1 M 2 meet gi 1 m = gi 2 m, it says K 1 and K 2, L (K 1 ) and L (K 2 ) are respectively connotation consistent [3]. Given formal context K = (G, M, I), if formal context K 1 = (G 1, M 1, I 1 ) and K 2 = (G 2, M 2, I 2 ), if G 1 G, G 2 G, M 1 M, M 2 M, G 1 G 2, M 1 M 2, G 1 G 2, M 1 M 2, then the same domain formal context fold set to (G 1 G 2, M 1 M 2, I 1 I 2 ), as is shown by equation 5. g m γg μ m = ( γg )* γg Let I = {i1, i2, i3,..., im} for the entry space; a collection of items called itemsets, with k-item set of items is called k-itemsets. Transaction database TD of each transaction Tr has a unique identifier TID, and contains a term set T I. Association rule is of the form B A implicate, in which I A, B and B A = Rule is an objective measure of support. Support the rule that the percentage of samples to meet (2) (3) (4) (5)

4 30 H. Xu and L. Wang the rules. Support is the probability P (A B), of which, A B that contains both A and B services, that is, itemsets A and B and. Another association rule is an objective measure of confidence. Confidence is the conditional probability P (B A), which includes the A's work also includes the probability of B. Algorithm 1. association rule mining based on formal concept analysis Input: Concept lattice L. Output: Lattice L and after inserting the updated rule set R1 obtained from the algorithm array Rules [1,..., L ], Rules [N] represents the grid node N set of rules related to output. (1) IF f*({x*}) Intent(inf(L)) THEN; (2) Intent (inf (L)):=Intent (inf (L)) f*({x*}) (3) IF C=0 OR D 1 THEN (4) Rules[N] := GenerateRulesForNode(N); (5) R: = R Rules [N]; (6) FOR each parent node of N, DO D (C, D) (LHS D ) (7) Adding new lattice node H: (Φ, Intent (inf (L)) f * ({x*})), making H becomes inf (L); (8) IF Q THEN; (9) Notes for B [I]: = {C: Intent (C) = I}; (10) return R: = R Reduce (N); A given concept lattice L and inserted into the grid to the new transaction T, T, after inserting a new record for the lattice L'. And then compared to the original lattice L, after you insert the new transaction T, L ', there are three types of nodes. Way to keep the same. The other will change, but only change the extension, which are updated grid nodes. Another is the new grid node, which is to be inserted by the transaction and pay grid nodes generated in the original format does not exist in the content of the composition. The following diagram, as is shown by figure1. Fig. 1. The result of association rule data mining based on formal concept analysis Marked with a simplified approach to the representation of the concept of property, the principle is: the same word in the graph node label attribute appears only once, the top node is unique, its meaning for the empty set, and the extension contains all object file; the bottom node is unique, contains all the terms of its content properties, and the extension of the empty set.

5 The Application of Association Rule Mining in CRM Based on Formal Concept Analysis 31 3 Application of Formal Concept Analysis in the Association Rule Mining of CRM CRM is an enterprise business strategy, which according to customer segmentation and effective organization of corporate resources, develop a customer-centric business practices and the implementation of customer-centric business processes, and as a means to improve profitability capacity, revenue and customer satisfaction. Customer is an important asset, customer care center of the CRM, customer care and aim to establish long-term customers with the selection and effective business relationship with each customer "touch points" are closer to the customer, to understand customers, maximize profits and profit share [4]. Concept lattice, in addition to the classification and definition from the data concepts, it can be used to find objects, properties, dependencies between. This has two meanings: (1) part or all of the scanning grid structure can be used to generate the rule set in the future; (2) browse lattice structure, to test a certain given rules established. New grid node: set transaction with item set T to be inserted into the lattice L Tr, if a grid node N1 = (C1, D1) satisfy: (1) T, Intersection = D1 while for L in any of the node N2 have Intersection; (2) Intent (N2) for L in any meet N3> N1 node N3, Intersection; T Intent (N3) the N1 is generated as a sub-grid nodes, the N1 can produce a new grid node (C=C1+1, Z=D1 T). Algorithm 2. Application of association rule mining in CRM based on formal concept analysis Input: Conjunct implies the rule set R:P Q as well as an array Rules[1 L ], Rules[N] represents the grid node N set of rules related to L. Output: R=R 1 R 2. Rule sets R1 and R2 set the rules of the division R2 (Di), R1 and R2 are the same domain and two independent sets of rules. (1) R1 will be divided according to their content, build into the relationship between father and son; (2) IF inf(l) = (φ, φ) THEN (3) FOR k := 0 TO size DO (4) Intent(inf(L)) Intent(inf(L)) f*({x*}); (5) Notes for B [I] : = {C: Intent (C) = I}; (6) IF D k =D i THEN exit algorithm ENDIF (7) Int: = Intent(C) f ({x*})); (8) GenerateRulesForPartition(G k, Count 1k, D k ); (9) R:= R Reduce(N); (10) IF Intent(C) = f({x*})) THEN exit algorithm; The paper is using WindowsXP operating system, and using Visual C to achieve the above rule sets and computing algorithms. For randomly generated data sets, 80% probability of their relationship, the number of attributes is 50, we do scalability testing, each increase in the number of objects 582, recorded by the child form the background to generate the corresponding concept lattice implication and operation of the rule set time spent Apriori at the same time a direct comparison of the original form of the background corresponding to the generated concept lattice implication rules set the time, comparing the results shown in Figure 2.

6 32 H. Xu and L. Wang Fig. 2. The compare of association rule mining in CRM based on FCA with Apriori 4 Summary As a branch of applied mathematics, FCA (formal concept analysis) comes of the understanding of concept in philosophical domain. It is to describe the concept in formalization of symbol from extent and intent, and then realize the semantic information which can be understood by computer. This paper presents the application of association rule mining in CRM based on formal concept analysis. Experiments show that the proposed algorithm in the CRM more effective than the traditional algorithm. Acknowledgement. This paper is supported by not only Henan Science and Technology Agency science and technology research in 2010 (Key Project) under Grant no , but also Education Department of Henan Province Natural Science Research Program (2010A520030). References 1. Lin, S.-C., Tung, C.-H., Jan, N.-Y., Chiang, D.-A.: Evaluating Churn Model in CRM: A Case Study in Telecom. JCIT 6(11), (2011) 2. Burusco, A., Fuentes-González: Concept lattices defined from implication operators. Fuzzy Sets and Systems 114, (2000) 3. Wille, R.: Concept Graphs and Formal Concept Analysis. In: Delugach, H.S., Keeler, M.A., Searle, L., Lukose, D., Sowa, J.F. (eds.) ICCS LNCS (LNAI), vol. 1257, pp Springer, Heidelberg (1997) 4. Liu, B., Hsu, W., Ma, Y.: Mining association rules with multiple minimum supports. In: Proc. KDD 1999, San Diego, CA, USA, pp (1999)

Selection of Optimal Discount of Retail Assortments with Data Mining Approach

Selection of Optimal Discount of Retail Assortments with Data Mining Approach Available online at www.interscience.in Selection of Optimal Discount of Retail Assortments with Data Mining Approach Padmalatha Eddla, Ravinder Reddy, Mamatha Computer Science Department,CBIT, Gandipet,Hyderabad,A.P,India.

More information

Cluster analysis and Association analysis for the same data

Cluster analysis and Association analysis for the same data Cluster analysis and Association analysis for the same data Huaiguo Fu Telecommunications Software & Systems Group Waterford Institute of Technology Waterford, Ireland hfu@tssg.org Abstract: Both cluster

More information

Binary Coded Web Access Pattern Tree in Education Domain

Binary Coded Web Access Pattern Tree in Education Domain Binary Coded Web Access Pattern Tree in Education Domain C. Gomathi P.G. Department of Computer Science Kongu Arts and Science College Erode-638-107, Tamil Nadu, India E-mail: kc.gomathi@gmail.com M. Moorthi

More information

Visualization Method of Trajectory Data Based on GML, KML

Visualization Method of Trajectory Data Based on GML, KML Visualization Method of Trajectory Data Based on GML, KML Junhuai Li, Jinqin Wang, Lei Yu, Rui Qi, and Jing Zhang School of Computer Science & Engineering, Xi'an University of Technology, Xi'an 710048,

More information

Towards a Practical Approach to Discover Internal Dependencies in Rule-Based Knowledge Bases

Towards a Practical Approach to Discover Internal Dependencies in Rule-Based Knowledge Bases Towards a Practical Approach to Discover Internal Dependencies in Rule-Based Knowledge Bases Roman Simiński, Agnieszka Nowak-Brzezińska, Tomasz Jach, and Tomasz Xiȩski University of Silesia, Institute

More information

Formal Concept Analysis for Concept Collecting and Their Analysis *

Formal Concept Analysis for Concept Collecting and Their Analysis * Scientific Papers, University of Latvia, 2009. Vol. 751 Computer Science and Information Technologies 22 39 P. Formal Concept Analysis for Concept Collecting and Their Analysis * Darius Jurkevicius 1 and

More information

Structured Ontology and IR for Search & Discovery

Structured Ontology and IR for  Search & Discovery Structured Ontology and IR for Email Search & Discovery Peter Eklund and Richard Cole Knowledge, Visualization and Ordering Laboratory Distributed Systems Technology Research Centre Abstract This paper

More information

CHAPTER 3 DATA MINING AND CLUSTERING

CHAPTER 3 DATA MINING AND CLUSTERING CHAPTER 3 DATA MINING AND CLUSTERING 3.1 Introduction Nowadays, large quantities of data are being accumulated. The amount of data collected is said to be almost doubled every 9 months. Seeking knowledge

More information

What can closed sets of students and their marks say?

What can closed sets of students and their marks say? What can closed sets of students and their marks say? Dmitry Ignatov and Serafima Mamedova and Nikita Romashkin and Ivan Shamshurin, University Higher School of Economics, Russia This paper presents an

More information

Enhanced Boosted Trees Technique for Customer Churn Prediction Model

Enhanced Boosted Trees Technique for Customer Churn Prediction Model IOSR Journal of Engineering (IOSRJEN) ISSN (e): 2250-3021, ISSN (p): 2278-8719 Vol. 04, Issue 03 (March. 2014), V5 PP 41-45 www.iosrjen.org Enhanced Boosted Trees Technique for Customer Churn Prediction

More information

What can closed sets of students and their marks say?

What can closed sets of students and their marks say? What can closed sets of students and their marks say? Dmitry Ignatov and Serafima Mamedova and Nikita Romashkin, University Higher School of Economics, Russia This paper presents an application of formal

More information

Research on the UHF RFID Channel Coding Technology based on Simulink

Research on the UHF RFID Channel Coding Technology based on Simulink Vol. 6, No. 7, 015 Research on the UHF RFID Channel Coding Technology based on Simulink Changzhi Wang Shanghai 0160, China Zhicai Shi* Shanghai 0160, China Dai Jian Shanghai 0160, China Li Meng Shanghai

More information

Step-coordination Algorithm of Traffic Control Based on Multi-agent System

Step-coordination Algorithm of Traffic Control Based on Multi-agent System International Journal of Automation and Computing 6(3), August 2009, 308-313 DOI: 10.1007/s11633-009-0308-z Step-coordination Algorithm of Traffic Control Based on Multi-agent System Hai-Tao Zhang 1 Fang

More information

Email Spam Detection Using Customized SimHash Function

Email Spam Detection Using Customized SimHash Function International Journal of Research Studies in Computer Science and Engineering (IJRSCSE) Volume 1, Issue 8, December 2014, PP 35-40 ISSN 2349-4840 (Print) & ISSN 2349-4859 (Online) www.arcjournals.org Email

More information

Apriori algorithm for economic data mining in sports industry

Apriori algorithm for economic data mining in sports industry COMPUTER MODELLING & NEW TECHNOLOGIES 014 18(1C) 451-455 Apriori algorithm for economic data mining in sports industry Abstract Yaguang Xiang* Sports Institute, West Anhui University, Liu'an, 3701,Anhui,

More information

Section 3.2 Partial Order

Section 3.2 Partial Order 1 Section 3.2 Purpose of Section To introduce a partial order relation (or ordering) on a set. We also see how order relations can be illustrated graphically by means of Hasse diagrams and directed graphs.

More information

CHARACTERIZING OF INFRASTRUCTURE BY KNOWLEDGE OF MOBILE HYBRID SYSTEM

CHARACTERIZING OF INFRASTRUCTURE BY KNOWLEDGE OF MOBILE HYBRID SYSTEM INTERNATIONAL JOURNAL OF ADVANCED RESEARCH IN ENGINEERING AND SCIENCE CHARACTERIZING OF INFRASTRUCTURE BY KNOWLEDGE OF MOBILE HYBRID SYSTEM Mohammad Badruzzama Khan 1, Ayesha Romana 2, Akheel Mohammed

More information

Design call center management system of e-commerce based on BP neural network and multifractal

Design call center management system of e-commerce based on BP neural network and multifractal Available online www.jocpr.com Journal of Chemical and Pharmaceutical Research, 2014, 6(6):951-956 Research Article ISSN : 0975-7384 CODEN(USA) : JCPRC5 Design call center management system of e-commerce

More information

COMPARING MATRIX-BASED AND GRAPH-BASED REPRESENTATIONS FOR PRODUCT DESIGN

COMPARING MATRIX-BASED AND GRAPH-BASED REPRESENTATIONS FOR PRODUCT DESIGN 12 TH INTERNATIONAL DEPENDENCY AND STRUCTURE MODELLING CONFERENCE, 22 23 JULY 2010, CAMBRIDGE, UK COMPARING MATRIX-BASED AND GRAPH-BASED REPRESENTATIONS FOR PRODUCT DESIGN Andrew H Tilstra 1, Matthew I

More information

CONCEPTUAL MODEL OF MULTI-AGENT BUSINESS COLLABORATION BASED ON CLOUD WORKFLOW

CONCEPTUAL MODEL OF MULTI-AGENT BUSINESS COLLABORATION BASED ON CLOUD WORKFLOW CONCEPTUAL MODEL OF MULTI-AGENT BUSINESS COLLABORATION BASED ON CLOUD WORKFLOW 1 XINQIN GAO, 2 MINGSHUN YANG, 3 YONG LIU, 4 XIAOLI HOU School of Mechanical and Precision Instrument Engineering, Xi'an University

More information

Facilitating Business Process Discovery using Email Analysis

Facilitating Business Process Discovery using Email Analysis Facilitating Business Process Discovery using Email Analysis Matin Mavaddat Matin.Mavaddat@live.uwe.ac.uk Stewart Green Stewart.Green Ian Beeson Ian.Beeson Jin Sa Jin.Sa Abstract Extracting business process

More information

Building A Smart Academic Advising System Using Association Rule Mining

Building A Smart Academic Advising System Using Association Rule Mining Building A Smart Academic Advising System Using Association Rule Mining Raed Shatnawi +962795285056 raedamin@just.edu.jo Qutaibah Althebyan +962796536277 qaalthebyan@just.edu.jo Baraq Ghalib & Mohammed

More information

5. Binary objects labeling

5. Binary objects labeling Image Processing - Laboratory 5: Binary objects labeling 1 5. Binary objects labeling 5.1. Introduction In this laboratory an object labeling algorithm which allows you to label distinct objects from a

More information

Approximating Concept Stability

Approximating Concept Stability Approximating Concept Stability Mikhail A. Babin and Sergei O. Kuznetsov National Research University Higher School of Economics, Pokrovskii bd. 11, 109028 Moscow, Russia mikleb@yandex.ru, skuznetsov@hse.ru

More information

Distributed Data Mining Algorithm Parallelization

Distributed Data Mining Algorithm Parallelization Distributed Data Mining Algorithm Parallelization B.Tech Project Report By: Rishi Kumar Singh (Y6389) Abhishek Ranjan (10030) Project Guide: Prof. Satyadev Nandakumar Department of Computer Science and

More information

Blog Post Extraction Using Title Finding

Blog Post Extraction Using Title Finding Blog Post Extraction Using Title Finding Linhai Song 1, 2, Xueqi Cheng 1, Yan Guo 1, Bo Wu 1, 2, Yu Wang 1, 2 1 Institute of Computing Technology, Chinese Academy of Sciences, Beijing 2 Graduate School

More information

2.3. Relations. Arrow diagrams. Venn diagrams and arrows can be used for representing

2.3. Relations. Arrow diagrams. Venn diagrams and arrows can be used for representing 2.3. RELATIONS 32 2.3. Relations 2.3.1. Relations. Assume that we have a set of men M and a set of women W, some of whom are married. We want to express which men in M are married to which women in W.

More information

Computing Fundamentals 2 Lecture 4 Lattice Theory. Lecturer: Patrick Browne

Computing Fundamentals 2 Lecture 4 Lattice Theory. Lecturer: Patrick Browne Computing Fundamentals 2 Lecture 4 Lattice Theory Lecturer: Patrick Browne Partial Order (e.g. ) A binary relation on a set B is called a partial order on B if it is: reflexive, anti-symmetric, and transitive.

More information

2.1. The Notion of Customer Relationship Management (CRM)

2.1. The Notion of Customer Relationship Management (CRM) Int. J. Innovative Ideas (IJII) www.publishtopublic.com A Review on CRM and CIS: A Service Oriented Approach A Review on CRM and CIS: A Service Oriented Approach Shadi Hajibagheri 1, *, Babak Shirazi 2,

More information

Hawkes Learning Systems: College Algebra

Hawkes Learning Systems: College Algebra Hawkes Learning Systems: College Algebra Section 1.2: The Arithmetic of Algebraic Expressions Objectives o Components and terminology of algebraic expressions. o The field properties and their use in algebra.

More information

Dr. U. Devi Prasad Associate Professor Hyderabad Business School GITAM University, Hyderabad Email: Prasad_vungarala@yahoo.co.in

Dr. U. Devi Prasad Associate Professor Hyderabad Business School GITAM University, Hyderabad Email: Prasad_vungarala@yahoo.co.in 96 Business Intelligence Journal January PREDICTION OF CHURN BEHAVIOR OF BANK CUSTOMERS USING DATA MINING TOOLS Dr. U. Devi Prasad Associate Professor Hyderabad Business School GITAM University, Hyderabad

More information

IMPROVING BUSINESS PROCESS MODELING USING RECOMMENDATION METHOD

IMPROVING BUSINESS PROCESS MODELING USING RECOMMENDATION METHOD Journal homepage: www.mjret.in ISSN:2348-6953 IMPROVING BUSINESS PROCESS MODELING USING RECOMMENDATION METHOD Deepak Ramchandara Lad 1, Soumitra S. Das 2 Computer Dept. 12 Dr. D. Y. Patil School of Engineering,(Affiliated

More information

SEMANTIC WEB BASED INFERENCE MODEL FOR LARGE SCALE ONTOLOGIES FROM BIG DATA

SEMANTIC WEB BASED INFERENCE MODEL FOR LARGE SCALE ONTOLOGIES FROM BIG DATA SEMANTIC WEB BASED INFERENCE MODEL FOR LARGE SCALE ONTOLOGIES FROM BIG DATA J.RAVI RAJESH PG Scholar Rajalakshmi engineering college Thandalam, Chennai. ravirajesh.j.2013.mecse@rajalakshmi.edu.in Mrs.

More information

Action Reducts. Computer Science Department, University of Pittsburgh at Johnstown, Johnstown, PA 15904, USA 2

Action Reducts. Computer Science Department, University of Pittsburgh at Johnstown, Johnstown, PA 15904, USA 2 Action Reducts Seunghyun Im 1, Zbigniew Ras 2,3, Li-Shiang Tsay 4 1 Computer Science Department, University of Pittsburgh at Johnstown, Johnstown, PA 15904, USA sim@pitt.edu 2 Computer Science Department,

More information

Applied Mathematical Sciences, Vol. 7, 2013, no. 112, 5591-5597 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2013.

Applied Mathematical Sciences, Vol. 7, 2013, no. 112, 5591-5597 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2013. Applied Mathematical Sciences, Vol. 7, 2013, no. 112, 5591-5597 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2013.38457 Accuracy Rate of Predictive Models in Credit Screening Anirut Suebsing

More information

72. Ontology Driven Knowledge Discovery Process: a proposal to integrate Ontology Engineering and KDD

72. Ontology Driven Knowledge Discovery Process: a proposal to integrate Ontology Engineering and KDD 72. Ontology Driven Knowledge Discovery Process: a proposal to integrate Ontology Engineering and KDD Paulo Gottgtroy Auckland University of Technology Paulo.gottgtroy@aut.ac.nz Abstract This paper is

More information

Management Science Letters

Management Science Letters Management Science Letters 4 (2014) 905 912 Contents lists available at GrowingScience Management Science Letters homepage: www.growingscience.com/msl Measuring customer loyalty using an extended RFM and

More information

S.Thiripura Sundari*, Dr.A.Padmapriya**

S.Thiripura Sundari*, Dr.A.Padmapriya** Structure Of Customer Relationship Management Systems In Data Mining S.Thiripura Sundari*, Dr.A.Padmapriya** *(Department of Computer Science and Engineering, Alagappa University, Karaikudi-630 003 **

More information

APPLYING PARALLEL ASSOCIATION RULE MINING TO HETEROGENEOUS ENVIRONMENT

APPLYING PARALLEL ASSOCIATION RULE MINING TO HETEROGENEOUS ENVIRONMENT APPLYING PARALLEL ASSOCIATION RULE MINING TO HETEROGENEOUS ENVIRONMENT P.Asha 1 1 Research Scholar,Computer Science and Engineering Department, Sathyabama University, Chennai,Tamilnadu,India. ashapandian225@gmail.com

More information

Assessment of the Key Success Factors of Customer Relationship Management

Assessment of the Key Success Factors of Customer Relationship Management Assessment of the Key Success Factors of Customer Relationship Management Meysam Bagheri Pamsari, Maria Dehban, & Hossein Karimi Lulemani M.A. Student of Business Management, Science and Research Branch,

More information

Mining Online GIS for Crime Rate and Models based on Frequent Pattern Analysis

Mining Online GIS for Crime Rate and Models based on Frequent Pattern Analysis , 23-25 October, 2013, San Francisco, USA Mining Online GIS for Crime Rate and Models based on Frequent Pattern Analysis John David Elijah Sandig, Ruby Mae Somoba, Ma. Beth Concepcion and Bobby D. Gerardo,

More information

A new evaluation model for e-learning programs

A new evaluation model for e-learning programs A new evaluation model for e-learning programs Uranchimeg Tudevdagva 1, Wolfram Hardt 2 Abstract This paper deals with a measure theoretical model for evaluation of e-learning programs. Based on methods

More information

Mobile Phone APP Software Browsing Behavior using Clustering Analysis

Mobile Phone APP Software Browsing Behavior using Clustering Analysis Proceedings of the 2014 International Conference on Industrial Engineering and Operations Management Bali, Indonesia, January 7 9, 2014 Mobile Phone APP Software Browsing Behavior using Clustering Analysis

More information

Finding Frequent Patterns Based On Quantitative Binary Attributes Using FP-Growth Algorithm

Finding Frequent Patterns Based On Quantitative Binary Attributes Using FP-Growth Algorithm R. Sridevi et al Int. Journal of Engineering Research and Applications RESEARCH ARTICLE OPEN ACCESS Finding Frequent Patterns Based On Quantitative Binary Attributes Using FP-Growth Algorithm R. Sridevi,*

More information

A new Approach for Intrusion Detection in Computer Networks Using Data Mining Technique

A new Approach for Intrusion Detection in Computer Networks Using Data Mining Technique A new Approach for Intrusion Detection in Computer Networks Using Data Mining Technique Aida Parbaleh 1, Dr. Heirsh Soltanpanah 2* 1 Department of Computer Engineering, Islamic Azad University, Sanandaj

More information

Class notes Program Analysis course given by Prof. Mooly Sagiv Computer Science Department, Tel Aviv University second lecture 8/3/2007

Class notes Program Analysis course given by Prof. Mooly Sagiv Computer Science Department, Tel Aviv University second lecture 8/3/2007 Constant Propagation Class notes Program Analysis course given by Prof. Mooly Sagiv Computer Science Department, Tel Aviv University second lecture 8/3/2007 Osnat Minz and Mati Shomrat Introduction This

More information

The WAMS Power Data Processing based on Hadoop

The WAMS Power Data Processing based on Hadoop Proceedings of 2012 4th International Conference on Machine Learning and Computing IPCSIT vol. 25 (2012) (2012) IACSIT Press, Singapore The WAMS Power Data Processing based on Hadoop Zhaoyang Qu 1, Shilin

More information

Research on Semantic Web Service Composition Based on Binary Tree

Research on Semantic Web Service Composition Based on Binary Tree , pp.133-142 http://dx.doi.org/10.14257/ijgdc.2015.8.2.13 Research on Semantic Web Service Composition Based on Binary Tree Shengli Mao, Hui Zang and Bo Ni Computer School, Hubei Polytechnic University,

More information

Mining Multi Level Association Rules Using Fuzzy Logic

Mining Multi Level Association Rules Using Fuzzy Logic Mining Multi Level Association Rules Using Fuzzy Logic Usha Rani 1, R Vijaya Praash 2, Dr. A. Govardhan 3 1 Research Scholar, JNTU, Hyderabad 2 Dept. Of Computer Science & Engineering, SR Engineering College,

More information

New Matrix Approach to Improve Apriori Algorithm

New Matrix Approach to Improve Apriori Algorithm New Matrix Approach to Improve Apriori Algorithm A. Rehab H. Alwa, B. Anasuya V Patil Associate Prof., IT Faculty, Majan College-University College Muscat, Oman, rehab.alwan@majancolleg.edu.om Associate

More information

The Analysis Method about Change Domain of Business Process Model Based on the Behavior Profile of Petri Net

The Analysis Method about Change Domain of Business Process Model Based on the Behavior Profile of Petri Net Appl. Math. Inf. Sci. 6-3S, No. 3, 943-949 (2012) 943 Applied Mathematics & Information Sciences An International Journal The Analysis Method about Change Domain of Business Process Model Based on the

More information

Data mining knowledge representation

Data mining knowledge representation Data mining knowledge representation 1 What Defines a Data Mining Task? Task relevant data: where and how to retrieve the data to be used for mining Background knowledge: Concept hierarchies Interestingness

More information

Formal Concept Analysis

Formal Concept Analysis Formal Concept Analysis Part I Radim BĚLOHLÁVEK Dept. Computer Science Palacky University, Olomouc radim.belohlavek@acm.org Radim Belohlavek (UP Olomouc) Formal Concept Analysis 2011 1 / 111 Introduction

More information

An Order-Invariant Time Series Distance Measure [Position on Recent Developments in Time Series Analysis]

An Order-Invariant Time Series Distance Measure [Position on Recent Developments in Time Series Analysis] An Order-Invariant Time Series Distance Measure [Position on Recent Developments in Time Series Analysis] Stephan Spiegel and Sahin Albayrak DAI-Lab, Technische Universität Berlin, Ernst-Reuter-Platz 7,

More information

WEB PAGE CATEGORISATION BASED ON NEURONS

WEB PAGE CATEGORISATION BASED ON NEURONS WEB PAGE CATEGORISATION BASED ON NEURONS Shikha Batra Abstract: Contemporary web is comprised of trillions of pages and everyday tremendous amount of requests are made to put more web pages on the WWW.

More information

MAXIMAL FREQUENT ITEMSET GENERATION USING SEGMENTATION APPROACH

MAXIMAL FREQUENT ITEMSET GENERATION USING SEGMENTATION APPROACH MAXIMAL FREQUENT ITEMSET GENERATION USING SEGMENTATION APPROACH M.Rajalakshmi 1, Dr.T.Purusothaman 2, Dr.R.Nedunchezhian 3 1 Assistant Professor (SG), Coimbatore Institute of Technology, India, rajalakshmi@cit.edu.in

More information

Mining Association Rules: A Database Perspective

Mining Association Rules: A Database Perspective IJCSNS International Journal of Computer Science and Network Security, VOL.8 No.12, December 2008 69 Mining Association Rules: A Database Perspective Dr. Abdallah Alashqur Faculty of Information Technology

More information

Research on News Video Multi-topic Extraction and Summarization

Research on News Video Multi-topic Extraction and Summarization International Journal of New Technology and Research (IJNTR) ISSN:2454-4116, Volume-2, Issue-3, March 2016 Pages 37-39 Research on News Video Multi-topic Extraction and Summarization Di Li, Hua Huo Abstract

More information

Journal of Information Technology Impact

Journal of Information Technology Impact Journal of Information Technology Impact Vol. 5, No. 3, pp. 129-138, 2005 Using a Priori Algorithm for Supporting an e-commerce System Mohammad Nazir Ahmad Sharif 1 Ng Moon Ching 2 Aryati Bakri 3 Nor Hidayati

More information

A Knowledge Management Framework Using Business Intelligence Solutions

A Knowledge Management Framework Using Business Intelligence Solutions www.ijcsi.org 102 A Knowledge Management Framework Using Business Intelligence Solutions Marwa Gadu 1 and Prof. Dr. Nashaat El-Khameesy 2 1 Computer and Information Systems Department, Sadat Academy For

More information

Effective Data Mining Using Neural Networks

Effective Data Mining Using Neural Networks IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 8, NO. 6, DECEMBER 1996 957 Effective Data Mining Using Neural Networks Hongjun Lu, Member, IEEE Computer Society, Rudy Setiono, and Huan Liu,

More information

Low Power Multi Bit Flip Flops Design for VLSI Circuits

Low Power Multi Bit Flip Flops Design for VLSI Circuits Low Power Multi Bit Flip Flops Design for VLSI Circuits L.Angel Prabha 1, S.Joy 2 M.E Applied Electronics, V.S.B Engineering College, Karur, Tamilnadu, India 1, 2 ABSTRACT: In this paper we present a power

More information

A Network Simulation Experiment of WAN Based on OPNET

A Network Simulation Experiment of WAN Based on OPNET A Network Simulation Experiment of WAN Based on OPNET 1 Yao Lin, 2 Zhang Bo, 3 Liu Puyu 1, Modern Education Technology Center, Liaoning Medical University, Jinzhou, Liaoning, China,yaolin111@sina.com *2

More information

Arithmetic Coding: Introduction

Arithmetic Coding: Introduction Data Compression Arithmetic coding Arithmetic Coding: Introduction Allows using fractional parts of bits!! Used in PPM, JPEG/MPEG (as option), Bzip More time costly than Huffman, but integer implementation

More information

The Applications of Business Intelligence to the Improvement of Supply Chain Management A Case of an Electronic Company

The Applications of Business Intelligence to the Improvement of Supply Chain Management A Case of an Electronic Company JOURNAL OF SOFTWARE, VOL. 6, NO. 11, NOVEMBER 2011 2173 The Applications of Business Intelligence to the Improvement of Supply Chain Management A Case of an Electronic Company Chwei-Jen Fan Dept. of Information

More information

Discovery of Maximal Frequent Item Sets using Subset Creation

Discovery of Maximal Frequent Item Sets using Subset Creation Discovery of Maximal Frequent Item Sets using Subset Creation Jnanamurthy HK, Vishesh HV, Vishruth Jain, Preetham Kumar, Radhika M. Pai Department of Information and Communication Technology Manipal Institute

More information

Research of CRM Based on Customer Intelligence Engine *

Research of CRM Based on Customer Intelligence Engine * Sep. 2004 Journal of Electronic Science and Technology of China Vol.2 No.3 Research of CRM Based on Customer Intelligence Engine * HOU Lun, TANG Xiaowo (School of Management, UESTC Chengdu 610054 China)

More information

Laboratory Module 8 Mining Frequent Itemsets Apriori Algorithm

Laboratory Module 8 Mining Frequent Itemsets Apriori Algorithm Laboratory Module 8 Mining Frequent Itemsets Apriori Algorithm Purpose: key concepts in mining frequent itemsets understand the Apriori algorithm run Apriori in Weka GUI and in programatic way 1 Theoretical

More information

Extraction of Tag Tree Patterns with Contractible Variables from Irregular Semistructured Data

Extraction of Tag Tree Patterns with Contractible Variables from Irregular Semistructured Data Extraction of Tag Tree Patterns with Contractible Variables from Irregular Semistructured Data Tetsuhiro Miyahara 1, Yusuke Suzuki 2, Takayoshi Shoudai 2, Tomoyuki Uchida 1, Sachio Hirokawa 3, Kenichi

More information

Static Data Mining Algorithm with Progressive Approach for Mining Knowledge

Static Data Mining Algorithm with Progressive Approach for Mining Knowledge Global Journal of Business Management and Information Technology. Volume 1, Number 2 (2011), pp. 85-93 Research India Publications http://www.ripublication.com Static Data Mining Algorithm with Progressive

More information

FACTORIZATION METHODS OF BINARY, TRIADIC, REAL AND FUZZY DATA

FACTORIZATION METHODS OF BINARY, TRIADIC, REAL AND FUZZY DATA STUDIA UNIV. BABEŞ BOLYAI, INFORMATICA, Volume LVI, Number 2, 2011 FACTORIZATION METHODS OF BINARY, TRIADIC, REAL AND FUZZY DATA CYNTHIA VERA GLODEANU Abstract. We compare two methods regarding the factorization

More information

ESub: Exploration of Subgraphs

ESub: Exploration of Subgraphs ESub: Exploration of Subgraphs A tool for exploring models generated by Graph Mining algorithms Claudia Diamantini, Laura Genga, and Domenico Potena Information Engineering Department Università Politecnica

More information

A Survey on Association Rule Mining in Market Basket Analysis

A Survey on Association Rule Mining in Market Basket Analysis International Journal of Information and Computation Technology. ISSN 0974-2239 Volume 4, Number 4 (2014), pp. 409-414 International Research Publications House http://www. irphouse.com /ijict.htm A Survey

More information

Binary Image Scanning Algorithm for Cane Segmentation

Binary Image Scanning Algorithm for Cane Segmentation Binary Image Scanning Algorithm for Cane Segmentation Ricardo D. C. Marin Department of Computer Science University Of Canterbury Canterbury, Christchurch ricardo.castanedamarin@pg.canterbury.ac.nz Tom

More information

TREE BASIC TERMINOLOGIES

TREE BASIC TERMINOLOGIES TREE Trees are very flexible, versatile and powerful non-liner data structure that can be used to represent data items possessing hierarchical relationship between the grand father and his children and

More information

131-1. Adding New Level in KDD to Make the Web Usage Mining More Efficient. Abstract. 1. Introduction [1]. 1/10

131-1. Adding New Level in KDD to Make the Web Usage Mining More Efficient. Abstract. 1. Introduction [1]. 1/10 1/10 131-1 Adding New Level in KDD to Make the Web Usage Mining More Efficient Mohammad Ala a AL_Hamami PHD Student, Lecturer m_ah_1@yahoocom Soukaena Hassan Hashem PHD Student, Lecturer soukaena_hassan@yahoocom

More information

Building FCA-based Decision Trees for the Selection of Heterogeneous Services

Building FCA-based Decision Trees for the Selection of Heterogeneous Services Building FCA-based Decision Trees for the Selection of Heterogeneous Services Stéphanie Chollet, Vincent Lestideau, Philippe Lalanda, Yoann Maurel Laboratoire d Informatique de Grenoble F-38041 Grenoble

More information

Future Trend Prediction of Indian IT Stock Market using Association Rule Mining of Transaction data

Future Trend Prediction of Indian IT Stock Market using Association Rule Mining of Transaction data Volume 39 No10, February 2012 Future Trend Prediction of Indian IT Stock Market using Association Rule Mining of Transaction data Rajesh V Argiddi Assit Prof Department Of Computer Science and Engineering,

More information

Efficient Data Recovery scheme in PTS-Based OFDM systems with MATRIX Formulation

Efficient Data Recovery scheme in PTS-Based OFDM systems with MATRIX Formulation Efficient Data Recovery scheme in PTS-Based OFDM systems with MATRIX Formulation Sunil Karthick.M PG Scholar Department of ECE Kongu Engineering College Perundurau-638052 Venkatachalam.S Assistant Professor

More information

ISSN: 2321-7782 (Online) Volume 3, Issue 4, April 2015 International Journal of Advance Research in Computer Science and Management Studies

ISSN: 2321-7782 (Online) Volume 3, Issue 4, April 2015 International Journal of Advance Research in Computer Science and Management Studies ISSN: 2321-7782 (Online) Volume 3, Issue 4, April 2015 International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online

More information

Grid Density Clustering Algorithm

Grid Density Clustering Algorithm Grid Density Clustering Algorithm Amandeep Kaur Mann 1, Navneet Kaur 2, Scholar, M.Tech (CSE), RIMT, Mandi Gobindgarh, Punjab, India 1 Assistant Professor (CSE), RIMT, Mandi Gobindgarh, Punjab, India 2

More information

Classify then Summarize or Summarize then Classify

Classify then Summarize or Summarize then Classify Classify then Summarize or Summarize then Classify DIMACS, Rutgers University Piscataway, NJ 08854 Workshop Honoring Edwin Diday held on September 4, 2007 What is Cluster Analysis? Software package? Collection

More information

CSC 380/480 Foundations of Artificial Intelligence Winter 2007 Assignment 1 Solution to Selected Problems

CSC 380/480 Foundations of Artificial Intelligence Winter 2007 Assignment 1 Solution to Selected Problems CSC 380/480 Foundations of Artificial Intelligence Winter 2007 Assignment 1 Solution to Selected Problems 1. News Filtering Agent: Summary: There is not a single correct answer to this problem. Specific

More information

A neural network approach to key frame extraction

A neural network approach to key frame extraction Rochester Institute of Technology RIT Scholar Works Articles 2003 A neural network approach to key frame extraction Rajesh Narasimha Andreas Savakis Raghuveer Rao Follow this and additional works at: http://scholarworks.rit.edu/article

More information

ASSOCIATION RULE MINING ON WEB LOGS FOR EXTRACTING INTERESTING PATTERNS THROUGH WEKA TOOL

ASSOCIATION RULE MINING ON WEB LOGS FOR EXTRACTING INTERESTING PATTERNS THROUGH WEKA TOOL International Journal Of Advanced Technology In Engineering And Science Www.Ijates.Com Volume No 03, Special Issue No. 01, February 2015 ISSN (Online): 2348 7550 ASSOCIATION RULE MINING ON WEB LOGS FOR

More information

Parametric Attack Graph Construction and Analysis

Parametric Attack Graph Construction and Analysis Parametric Attack Graph Construction and Analysis Leanid Krautsevich Department of Computer Science, University of Pisa Largo Bruno Pontecorvo 3, Pisa 56127, Italy Istituto di Informatica e Telematica,

More information

Full-text Search in Intermediate Data Storage of FCART

Full-text Search in Intermediate Data Storage of FCART Full-text Search in Intermediate Data Storage of FCART Alexey Neznanov, Andrey Parinov National Research University Higher School of Economics, 20 Myasnitskaya Ulitsa, Moscow, 101000, Russia ANeznanov@hse.ru,

More information

Fig. 1 A typical Knowledge Discovery process [2]

Fig. 1 A typical Knowledge Discovery process [2] Volume 4, Issue 7, July 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com A Review on Clustering

More information

Method of Fault Detection in Cloud Computing Systems

Method of Fault Detection in Cloud Computing Systems , pp.205-212 http://dx.doi.org/10.14257/ijgdc.2014.7.3.21 Method of Fault Detection in Cloud Computing Systems Ying Jiang, Jie Huang, Jiaman Ding and Yingli Liu Yunnan Key Lab of Computer Technology Application,

More information

Research and Design of Universal and Open Software Development Platform for Digital Home

Research and Design of Universal and Open Software Development Platform for Digital Home Research and Design of Universal and Open Software Development Platform for Digital Home CaiFeng Cao School of Computer Wuyi University, Jiangmen 529020, China cfcao@126.com Abstract. With the development

More information

Dr. Antony Selvadoss Thanamani, Head & Associate Professor, Department of Computer Science, NGM College, Pollachi, India.

Dr. Antony Selvadoss Thanamani, Head & Associate Professor, Department of Computer Science, NGM College, Pollachi, India. Enhanced Approach on Web Page Classification Using Machine Learning Technique S.Gowri Shanthi Research Scholar, Department of Computer Science, NGM College, Pollachi, India. Dr. Antony Selvadoss Thanamani,

More information

Fuzzy Logic -based Pre-processing for Fuzzy Association Rule Mining

Fuzzy Logic -based Pre-processing for Fuzzy Association Rule Mining Fuzzy Logic -based Pre-processing for Fuzzy Association Rule Mining by Ashish Mangalampalli, Vikram Pudi Report No: IIIT/TR/2008/127 Centre for Data Engineering International Institute of Information Technology

More information

An Open Integrated Environment for Transparent Fuzzy Agents Design

An Open Integrated Environment for Transparent Fuzzy Agents Design An Open Integrated Environment for Transparent Fuzzy Agents Design Department of Mathematics and Computer Science, University of Salerno via Ponte don Melillo, 84084 Fisciano, Salerno, Italy {gacampora,loia}@unisa.it

More information

INTERACTIVE AUDIENCE SELECTION TOOL FOR DISTRIBUTING A MOBILE CAMPAIGN

INTERACTIVE AUDIENCE SELECTION TOOL FOR DISTRIBUTING A MOBILE CAMPAIGN INTERACTIVE AUDIENCE SELECTION TOOL FOR DISTRIBUTING A MOBILE CAMPAIGN Talya Porat, Lihi Naamani-Dery, Lior Rokach and Bracha Shapira Deutsche Telekom Laboratories at Ben Gurion University Beer Sheva,

More information

Advanced Image Compression on the Basis of Fuzzy Transforms

Advanced Image Compression on the Basis of Fuzzy Transforms University of Ostrava Institute for Research and Applications of Fuzzy Modeling Advanced Image Compression on the Basis of Fuzzy Transforms Irina Perfilieva, Viktor Pavliska, Marek Vajgl, Bernard De Baets

More information

Innovative Analysis of a CRM Database using Online Analytical Processing (OLAP) Technique in Value Chain Management Approach

Innovative Analysis of a CRM Database using Online Analytical Processing (OLAP) Technique in Value Chain Management Approach Innovative Analysis of a CRM Database using Online Analytical Processing (OLAP) Technique in Value Chain Management Approach ADRIAN MICU, ANGELA-ELIZA MICU, ALEXANDRU CAPATINA Faculty of Economics, Dunărea

More information

Graph Mining and Social Network Analysis

Graph 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 information

A Novel Approach for Network Traffic Summarization

A Novel Approach for Network Traffic Summarization A Novel Approach for Network Traffic Summarization Mohiuddin Ahmed, Abdun Naser Mahmood, Michael J. Maher School of Engineering and Information Technology, UNSW Canberra, ACT 2600, Australia, Mohiuddin.Ahmed@student.unsw.edu.au,A.Mahmood@unsw.edu.au,M.Maher@unsw.

More information

Series and Parallel Resistive Circuits

Series and Parallel Resistive Circuits Series and Parallel Resistive Circuits The configuration of circuit elements clearly affects the behaviour of a circuit. Resistors connected in series or in parallel are very common in a circuit and act

More information

DISCOVER MERCHANT PREDICTOR MODEL

DISCOVER MERCHANT PREDICTOR MODEL DISCOVER MERCHANT PREDICTOR MODEL A Proactive Approach to Merchant Retention Welcome to Different. A High-Level View of Merchant Attrition It s a well-known axiom of business that it costs a lot more to

More information