Fuzzy Cognitive Maps application for Webmining
|
|
- Terence Booth
- 6 years ago
- Views:
Transcription
1 Fuzzy Cognitive Maps application for Webmining Andreas Kakolyris Dept. Computer Science, University of Ioannina Greece, George Stylios Dept. of Communications, Informatics and Management, TEI of Epirus, Greece Voula Georgopoulos Dept. of Speech and Language Therapy, Technological and Educational Institute of Patras, Patras, Greece Abstract This work examines and proposes a new method for web mining inference based on Fuzzy Cognitive Maps. The web mining inference and knowledge extraction consists of two phases. At the first phase the a priori algorithm is used for web mining and a collection of Association rules is inferred. In the second phase, the set of Association Rules is transformed into a Fuzzy Cognitive Map (FCM). It investigates a new methodology for developing Fuzzy Cognitive Maps so that they can be suitable for web mining inference. Keywords: Web mining, Association rules, Fuzzy Cognitive Maps. 1 Introduction This research work proposes a new methodology for web mining inference, knowledge extraction and representation. This method consists of two stages, at the first phase the a priori algorithm is used for web mining and a collection of Association rules is inferred. These rules have the form Α Β, where Α and Β are objects or a set of objects and each rule describes the possibility to visit B if it is known that the user has previously visited A. Association rules is a convenient method to represent knowledge because they describe the behavior of users and their preferences. Association rules contain great information, but they are not well organized and it is quite difficult to understand much of the containing knowledge and information, which is not expressed and explained. Thus, there is a need for further processing. Here is proposed the transformation of Association Rules into FCMs so that to present in an adequate way, hidden knowledge and the inferred results. FCM is a great tool to simulate and represent the behavior of users and their preferences. The proposed methodology performs web mining to web log files. The structure and usage of the methodology is described and the way it analyzes web mining results, offering a description concerning users navigation behavior within a web site, is explained. 2 Web usage mining Web Usage Mining aims to satisfy the needs of the owners and creators of web resources. The goal is to extract knowledge about internet users by discovering patterns regarding users characteristics, preferences and activities in certain web locations. The objective of web usage mining is the pattern discovery regarding navigation, characteristics and preferences of web site users, whose activity is recorded by the corresponding web servers. The data collected by the servers are stored into web server access or referrer logs. These data are called Internet secondary data [1]. The first phase of web usage mining consists of two main steps: Step1. Preprocessing o The original data set (web server log files) is cleaned of unused information and errors (Data Cleaning) o Remaining data are organized to transactions, according to the needs of the physical problem 593
2 and the pattern discovery method used (Transaction Recognition) Transactions are determined by the type of resource (Missing Transactions) or the time the user spent on the resource (Time Window Approach) Transactions of the same user are grouped into a single record for more efficient processing (Grouping Transactions) Step2: Pattern Discovery o Association rules are extracted from transactions using the apriori algorithm (Association rule extraction) 3 Association Rule Extraction After the preprocessing stage, the next step is the extraction of existing patterns from the dataset and transformation into Association rules [2].This method aims to discover associations among transaction sets and to define the exact rules that govern these relations. Association rules have the form X Y with support A% and confidence B%. Where X and Y are transaction sets. Here X is a set of items found in transactions. Y is a set consisting of just one item, not found in X. Thus, if Τ={t 1,...,t n } the set of items found in all transactions, X T and Y= t i T-X. The support A% value represents the percentage of transactions that contain X and the confidence B% represent the percentage of transactions that verify the rule. In order to extract the Association rules, we apply the Apriori algorithm, which is simple, fast and easy to comprehend [3]. The concept of this algorithm is to find sets of items in the transactions that are frequent [4]. The Association rule extraction procedure according to Apriori algorithm is divided: 1. Discovery itemsets with support over a specified threshold. These itemsets are called large or frequent itemsets. 2. Extract the Association Rule based on the frequent itemsets. Definition 1 Frequent Itemsets are the items with Support value A over the defined threshold min_support. The Min_support is a defined parameter of the algorithm, which is modified by the user. This threshold value depends on each specific problem, the corresponding dataset and so it is experimentally defined. If the threshold value is too high, some important rules may be ignored. On the other hand, if the threshold value is too low, many of the extracted rules may be of little importance. Assume there is the following record in the table of transactions: A B Α D C A B C. This means that the user accessed these urls using the defined order. Subsets like {A B}, {A C}, {A B C} appear twice in the record but subsets like {B A} and {D C} appear only once. The items are chronologically ordered so the subsets are created by the union of an item with items to its right in each transaction. The algorithm uses multiple passes over the dataset to discover the frequent itemsets with increasing number of items. In the first pass the support of individual items (1-itemsets) is calculated. In the following passes new candidate frequent itemsets are created by combining the ones found in the previous pass. The apriori algorithm uses the property that if a k-itemset is frequent, all of its (k- 1)-subsets are also frequent. The opposite rule does not apply. If all of the subsets are frequent the set is not necessarily frequent, but may be frequent. Let itemset Y with support(y) = s. For every itemset X we can a priori say that: If X Y, then support(x) s If X Y, then support(x) s The key idea is that in the k th pass the algorithm will generate all k-itemsets from the frequent (k-1)- itemsets found in the previous pass. After a pass over the original dataset we find which of these candidate k-itemsets are indeed frequent. There are no other frequent sets, because another conclusion as a result of the property mentioned above is that if a set X is not frequent, then none of its supersets can be frequent. The algorithm terminates when no new frequent sets are generated. The rule extraction is a quite straightforward process after the generation of the frequent sets. Rules are found in k-itemsets for k 2. Let a frequent itemset Y= {Ι 1,,I k }. The rule to be verified is I 1,, I k-1 I k.. In order to calculate how powerful the rule is, it is necessary to see the ratio support(y)/support(x), where Χ=Υ-I k is calculated. This ratio is called the confidence value for this rule. If the measured confidence is greater than the min_confidence 594
3 threshold then this rule is considered to be important, otherwise it is ignored. The value of min_confidence threshold value depends on the specific problem, the corresponding data and it is experimentally defined by the user. There is no need to examine rules with other forms than I j+1,, I k I j. Only these rules will be valid. All others will not have enough support, because of the way frequent sets are generated. 4. Fuzzy Cognitive Maps representing web user behavior Fuzzy Cognitive Maps (FCMs) is a soft computing technique that follows an approach similar to the human reasoning and human decision-making process. Fuzzy Cognitive Maps (FCMs) have been used successfully for the modeling of complex systems by describing them using related concepts. A FCM consists of nodes (concepts) that illustrate the different aspects of the system s behaviour. These nodes (concepts) interact with each other showing the dynamics of the model. Fig. 1 illustrates a graphical representation of a FCM [5]. E 1--> C E1-->3 E 1--> E3-->2 C C E 2--> Fig1. Simple Fuzzy Cognitive Map representation A fuzzy cognitive map is a graph consisting of a collection of nodes where each node has a value whose meaning depends on its representation and this value usually belongs to the interval [0, 1]. The FCM nodes are interconnected with weighted edges. These edges show the causal relation between nodes. Edges have weights w taking values in the interval w [-1, 1] R. These weights indicate with what degree one concept influences another. Positive weight value indicates positive causality, while negative weights indicate negative causality. The purpose of the creation of such a mapping is to obtain more complex conclusions than with a set of rules, so the knowledge extraction process is greatly amplified. Due to the dynamic properties of the FCM created by these rules, it can be used for the simulation of user behavior by changing some of the initial system parameters [6] [7]. 4.1 Developing the FCM-web The Fuzzy Cognitive Map consists of a set of nodes and directed edges between them. The nodes of the FCM-web represent the itemsets that were found applying the Apriori algorithm for developing the association rules. For example, if there were found an association rule url1 url2 url3, then two nodes are added to the FCM-web: (url1 url2) (url3) Each node of the FCM-web has a value attached to it, which stands for the support that the corresponding itemset has in the original dataset. This support value has been calculated when the corresponding association rule was extracted and its value is in the interval [0, 1] by definition. The FCM-web consists of the nodes that are found in the association rules plus those that make up itemsets with more than one items. When the nodes of FCM-web have been determined, the next step is the determination of the causal weighted interconnections among concepts. Two kinds of edges of FCM-web are defined: The first kinds of edges stand for the direct relation between two nodes exactly the same as in the corresponding association rule. The weight of this edge is the confidence value of that rule. Although in the general definition of the FCM weighted edges have values in [-1, 1] in this case the interval is limited in the [0, 1] because confidence takes values in that interval. We will refer to these edges as edges type 1. The second kind of edges is used for associating a composite node. We define as composite node the node that represents an itemset consisting of more than one items urls. For this kind of edges, there is not an easily derived weight value from the Association Rule. We will refer to them as type 2 edges. 595
4 Example 4.1 Assuming that the web mining procedure has produced the following Association rules: A B A C AB C B A B D ABC D BDC A. The nodes of the FCM-web for this case are easily derived from Association rules, consisted of 7 nodes, which are the itemsets appearing at least one time either to the right or the left part of the Association rule. For these nodes the type 1 edges, are easily derived, and they appear in Fig. 2 in solid line. The rule AB C says that if AB appears in the dataset, then at next step C will appear with a certain amount of confidence. This means that if the support value of AB changes so will do the support value of C. This kind of relationship between nodes is represented by edges of type 1. AB C ABC and simulate the behavior of web users. The FCMweb consisting of edges of type 1 and 2 is illustrated in Fig.2. A node of the FCM-web contains the following information: i. The node id for node identification: id ii. A pointer to the list of items (urls) of the node: *items iii. A pointer to the set of type 1 edges (only for nodes with one item) that indicate which nodes connect to this node: *e1 iv. A pointer to the set of type 2 edges (only for nodes with more than one items) that indicate which nodes with one item build the current node: *e2 v. The number of items the node has: items_number vi. The current value of the node: value vii. The previous value of the node, before the last computation (if any): old_value viii. The number of appearances of the itemset this node represents in the transaction set: apps ix. The ratio among items of a node with more than one item. This ratio is computed upon the creation of the FCM and remains constant: L x. A pointer to the next node of the list: *next 5 FCM-web Usage and Simulation A D B BDC Fig. 2. The FCM-web illustration with edges of type 1 and 2. If the Association rules had only one itemset in each part, this would be sufficient. But in fact, rules are more complicated and they have combined itemsets consisting of more than one itemsets. For this case, the type 1 edges are not sufficient, which are suitable when the consequent of an Association rule is only one itemset. In the example AB C there is no way of calculating the value of node (AB) when the values of (A) and (B) change. To counter this problem we introduce edges of type 2. With this way, any interaction between all nodes of FCM-web is permitting that create a powerful tool to model When the FCM-web has been created, it can be used to describe the web-user behavior and it is possible to simulate user s behavior, altering the initial values of the nodes. Initially, values of nodes having certain support and appearances values. The goal of the simulation is to see how these values are affected when some of them are altered. When the support values of some nodes are changed, the FCM calculates new values for all nodes according to the previous values, to the connections between nodes and the user input. Because the support values may be misleading for correct conclusions, the number of expected appearances of the itemsets may be used instead. Different scenarios on the usage of FCM examines what will be the result on the other nodes if the support value of one node changes (times visiting the corresponding url). The FCM-web simulation consists of three phases. First the user chooses some nodes, to which he gives new support values. At the second step, node values are adjusted to satisfy logical limitations and at third step, the FCM-web gives the new expected values to all nodes. 596
5 5.1 User Input (first simulation step) It is assumed that the nodes chosen by the user are only those with one itemset (url ). The increase or decrease of the support value of a node has the meaning that there are more visits to that url in the log file. For a real web-server, in order to increase the measured support value of the url /home/products we could, for example, make the web link to the corresponding url more visible in the main page or add references to it. On the other hand, there is no meaning in directly changing the values of nodes with more than one item. Let s assume there is a node ABCD. A change in the support value of this itemset ABCD, cannot be done directly. An increase in the support value of node ABCD would mean that there was a way to persuade users to access urls with that order, which is not very realistic. 5.2 Value Adjustment (second simulation step) When the values of some notes are changed by the user of the FCM-web, the appropriate adjustment to the values of all nodes have to be done. This is due to the fact that the sum of the support value of all items in the dataset has to be to 1. But in the FCMweb not all itemsets are presented so that the sum of all the support values is 1. When the user changes the support of one or more nodes, the support value of the rest must be adjusted accordingly. Physically, an increase to the support of a url means that new references to that url are added to the dataset (it contains more references to that url). A decrease means that references are removed from the dataset (it contains less references to that url). Old_value and new_value are the previous and the current value of one node of the FCM-web, whose support is changed by the user. Prev_Transactions and Current_Transactions are the number of transactions calculated before and after the change of the support value of one node. Apps is the number of appearances that a node has in the dataset with transaction number Prev_Transactions. When the value of a node is changed in reality the number of appearances of the corresponding itemset in the dataset is changed. So the new support value of this node have to be calculated using (1), where x is the number of transaction added or deducted in order to get the new support value. apps x new _ + value = Pr ev _ Transactions + x (1) Therefore, the current total transactions number will be: Current _ Transactions = Pr ev _ Transactions + x (2) and the appearances of the node in the dataset: apps = apps + x (3) For the rest nodes the new support values are: apps value = (4) Current _ Transactions But in the FCM-web there are nodes representing more than one itemset, that have to be adjusted too, because the values of the items that constitute this combined itemset have changed. In this case the edges of type 2 are used and the L ratio is introduced. Consider the node representing the itemset (Ι 1,...,Ι n ). The support value for this itemset as well as the support of the individual items was calculated during the web mining stage. When a combined node is created, the ratio L is calculated as: sup port( I1,..., I n ) L = (5) sup port( I )*...*sup port( I ) 1 This ratio must remain constant, so that the ratio between the combined itemset and its items that was calculated in the original dataset will be preserved at all times. The previous support value of the itemset is not important. Its value is depended only on the current support values of its items. The new value for this combined node will be: new value = L* v *...* (6) _ 1 where v i the support value of individual nodes. Example 5.1 Consider the items A, B, C, D in a dataset of 10 transactions. For each item the support and appearances are known from the web mining procedure and are respectively provided in the brackets Item (support, Apps): A (0.2, 2), B(0.2, 2), C(0.5, 5) and D (0.1, 1) Let s suppose the user changes the support value of A from 0.2 to 0.5. Then, using (eq.1) we calculate that x=6 transactions must be inserted to obtain the new support value, so there are 6+2=8 appearances of A and a total of Current_Transactions=16. v i n 597
6 Next, the new support values for the rest of the nodes with 1 item are calculated: Β= 2/16= 0.125, C= 5/16= and D= 1/16= The sum of all supports is: 0,5+0,125+0,3125+0,0625=1. With this way the support values are normalized when the user changes some values of the concepts or there are some new computations for the FCM-web. 5.3 Calculation of new values for FCM-web (third simulation step) After the values of all nodes have been adjusted, at the third step new values for the FCM-web are calculated. In the FCM-web, the edges of type 1 affect nodes with one item. New_value is the new value of the node, current_value the value that a node currently has, conf is the confidence value of the edge between nodes and v is the support change of nodes affecting the current node. The new value is calculated using: new _ value = ( v * conf ) + current _ value (7) The computation steps are the following: i) Initially, for every node with one item the new value is calculated by the effect of edges type 1 of the other nodes with one item. A value adjustment is done as seen before. ii) For every node with more that one items the new value is calculated using the edges of type 2. iii) Finally, for every node with one item the final values are calculated from the effect of nodes with more than one items using edges of type 1. Again there is the appropriate value adjustment at the end s in step 1. The pseudocode that demonstrates the use and operation of the system is the following: 1. The user chooses a node and changes its value 2. Value adjustment of the rest of the nodes for consistency 3. Calculation of new values for the nodes with value adjustment after each step a. New values for nodes with one item b. New values for nodes with more than one item c. New values for nodes with one item affected by those with more than one item 4. Return to 1 6 Conclusions This research work presents a novel approach to develop a web user model describing the behavior of users visiting a web server. The methodology utilizes web mining method to extract the Association Rules from the log files. For better representation of information and knowledge existing in Association Rules, the use of Fuzzy Cognitive Maps is introduced. A novel augmented FCM-web is introduced suitable for web mining knowledge. There are defining two kinds of nodes for the FCM-web and two kinds of weighted interconnections among nodes. The use of FCM-web for web user behavior is described. Acknowledgments Funding for this research was provided by EPEAEK II: Archimedes -Research Support in TEI, Ministry of National Education & Religious Affairs Greece. References [1] R. Cooley, M. Mobasher, J. Srivastava, Data preparation for mining world wide web browsing patterns Knowledge and Information Systems,Vol 1, 1999, pp [2] J. Srivastava, R. Cooley, M. Deshpande, P.-N. Tan, Web Usage Mining: Discovery and Applications of Usage Patterns from Web Data, Technical Report, Depart. of Computer Science and Engineering, University of Minnesota (1999) [3] R. Agrawal, R. Srikant, Fast algorithms for mining association rules. Proc. Of the International Conference on Very Large Databases, pp (1994) [4] R. Agrawal, T. Imielinski and A Swami, Mining association rules between sets of items in large databases. In: Proc. of ACM SIGMOD Intl. Conf. on Management of Data, [5] C. Stylios, P. Groumpos and V. Georgopoulos An Fuzzy Cognitive Maps Approach to Process Control Systems. J. of Advanced Computational Intelligence,; Vol. 3, 1999, pp [6] K. C. Lee, J. S. Kim, N. H. Chung, S. J. Kwon, Fuzzy Cognitive Map Approach to web mining inference amplification, Expert Systems with Applications, vol. 22, 2002, pp [7] G. Meghabghab, Mining user s web searching skills: fuzzy cognitive state map vs. markovian modeling,journal of Computational Cognition, Vol.1, 2003, pp ,
Pattern Mining. Knowledge Discovery and Data Mining 1. Roman Kern KTI, TU Graz. Roman Kern (KTI, TU Graz) Pattern Mining / 42
Pattern Mining Knowledge Discovery and Data Mining 1 Roman Kern KTI, TU Graz 2016-01-14 Roman Kern (KTI, TU Graz) Pattern Mining 2016-01-14 1 / 42 Outline 1 Introduction 2 Apriori Algorithm 3 FP-Growth
More informationAssociation Rule Mining
Association Rule Mining Generating assoc. rules from frequent itemsets Assume that we have discovered the frequent itemsets and their support How do we generate association rules? Frequent itemsets: {1}
More informationAssociation Rule Mining among web pages for Discovering Usage Patterns in Web Log Data L.Mohan 1
Volume 4, No. 5, May 2013 (Special Issue) International Journal of Advanced Research in Computer Science RESEARCH PAPER Available Online at www.ijarcs.info Association Rule Mining among web pages for Discovering
More informationMaterialized Data Mining Views *
Materialized Data Mining Views * Tadeusz Morzy, Marek Wojciechowski, Maciej Zakrzewicz Poznan University of Technology Institute of Computing Science ul. Piotrowo 3a, 60-965 Poznan, Poland tel. +48 61
More informationAn Improved Apriori Algorithm for Association Rules
Research article An Improved Apriori Algorithm for Association Rules Hassan M. Najadat 1, Mohammed Al-Maolegi 2, Bassam Arkok 3 Computer Science, Jordan University of Science and Technology, Irbid, Jordan
More informationA NEW ASSOCIATION RULE MINING BASED ON FREQUENT ITEM SET
A NEW ASSOCIATION RULE MINING BASED ON FREQUENT ITEM SET Ms. Sanober Shaikh 1 Ms. Madhuri Rao 2 and Dr. S. S. Mantha 3 1 Department of Information Technology, TSEC, Bandra (w), Mumbai s.sanober1@gmail.com
More informationAN IMPROVISED FREQUENT PATTERN TREE BASED ASSOCIATION RULE MINING TECHNIQUE WITH MINING FREQUENT ITEM SETS ALGORITHM AND A MODIFIED HEADER TABLE
AN IMPROVISED FREQUENT PATTERN TREE BASED ASSOCIATION RULE MINING TECHNIQUE WITH MINING FREQUENT ITEM SETS ALGORITHM AND A MODIFIED HEADER TABLE Vandit Agarwal 1, Mandhani Kushal 2 and Preetham Kumar 3
More informationWeb Usage Mining for Comparing User Access Behaviour using Sequential Pattern
Web Usage Mining for Comparing User Access Behaviour using Sequential Pattern Amit Dipchandji Kasliwal #, Dr. Girish S. Katkar * # Malegaon, Nashik, Maharashtra, India * Dept. of Computer Science, Arts,
More informationSEQUENTIAL PATTERN MINING FROM WEB LOG DATA
SEQUENTIAL PATTERN MINING FROM WEB LOG DATA Rajashree Shettar 1 1 Associate Professor, Department of Computer Science, R. V College of Engineering, Karnataka, India, rajashreeshettar@rvce.edu.in Abstract
More informationA mining method for tracking changes in temporal association rules from an encoded database
A mining method for tracking changes in temporal association rules from an encoded database Chelliah Balasubramanian *, Karuppaswamy Duraiswamy ** K.S.Rangasamy College of Technology, Tiruchengode, Tamil
More informationLog Information Mining Using Association Rules Technique: A Case Study Of Utusan Education Portal
Log Information Mining Using Association Rules Technique: A Case Study Of Utusan Education Portal Mohd Helmy Ab Wahab 1, Azizul Azhar Ramli 2, Nureize Arbaiy 3, Zurinah Suradi 4 1 Faculty of Electrical
More informationPerformance Based Study of Association Rule Algorithms On Voter DB
Performance Based Study of Association Rule Algorithms On Voter DB K.Padmavathi 1, R.Aruna Kirithika 2 1 Department of BCA, St.Joseph s College, Thiruvalluvar University, Cuddalore, Tamil Nadu, India,
More informationAn Improved Algorithm for Mining Association Rules Using Multiple Support Values
An Improved Algorithm for Mining Association Rules Using Multiple Support Values Ioannis N. Kouris, Christos H. Makris, Athanasios K. Tsakalidis University of Patras, School of Engineering Department of
More informationAssociation Rule Mining: FP-Growth
Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong We have already learned the Apriori algorithm for association rule mining. In this lecture, we will discuss a faster
More informationAssociation Rule Mining. Entscheidungsunterstützungssysteme
Association Rule Mining Entscheidungsunterstützungssysteme Frequent Pattern Analysis Frequent pattern: a pattern (a set of items, subsequences, substructures, etc.) that occurs frequently in a data set
More informationGenerating Cross level Rules: An automated approach
Generating Cross level Rules: An automated approach Ashok 1, Sonika Dhingra 1 1HOD, Dept of Software Engg.,Bhiwani Institute of Technology, Bhiwani, India 1M.Tech Student, Dept of Software Engg.,Bhiwani
More informationMining Temporal Association Rules in Network Traffic Data
Mining Temporal Association Rules in Network Traffic Data Guojun Mao Abstract Mining association rules is one of the most important and popular task in data mining. Current researches focus on discovering
More informationWeb Service Usage Mining: Mining For Executable Sequences
7th WSEAS International Conference on APPLIED COMPUTER SCIENCE, Venice, Italy, November 21-23, 2007 266 Web Service Usage Mining: Mining For Executable Sequences MOHSEN JAFARI ASBAGH, HASSAN ABOLHASSANI
More informationWeb page recommendation using a stochastic process model
Data Mining VII: Data, Text and Web Mining and their Business Applications 233 Web page recommendation using a stochastic process model B. J. Park 1, W. Choi 1 & S. H. Noh 2 1 Computer Science Department,
More informationSensitive Rule Hiding and InFrequent Filtration through Binary Search Method
International Journal of Computational Intelligence Research ISSN 0973-1873 Volume 13, Number 5 (2017), pp. 833-840 Research India Publications http://www.ripublication.com Sensitive Rule Hiding and InFrequent
More informationApriori Algorithm. 1 Bread, Milk 2 Bread, Diaper, Beer, Eggs 3 Milk, Diaper, Beer, Coke 4 Bread, Milk, Diaper, Beer 5 Bread, Milk, Diaper, Coke
Apriori Algorithm For a given set of transactions, the main aim of Association Rule Mining is to find rules that will predict the occurrence of an item based on the occurrences of the other items in the
More informationMining N-most Interesting Itemsets. Ada Wai-chee Fu Renfrew Wang-wai Kwong Jian Tang. fadafu,
Mining N-most Interesting Itemsets Ada Wai-chee Fu Renfrew Wang-wai Kwong Jian Tang Department of Computer Science and Engineering The Chinese University of Hong Kong, Hong Kong fadafu, wwkwongg@cse.cuhk.edu.hk
More informationMining High Average-Utility Itemsets
Proceedings of the 2009 IEEE International Conference on Systems, Man, and Cybernetics San Antonio, TX, USA - October 2009 Mining High Itemsets Tzung-Pei Hong Dept of Computer Science and Information Engineering
More informationImplementing Synchronous Counter using Data Mining Techniques
Implementing Synchronous Counter using Data Mining Techniques Sangeetha S Assistant Professor,Department of Computer Science and Engineering, B.N.M Institute of Technology, Bangalore, Karnataka, India
More informationEXTRACTION OF INTERESTING PATTERNS THROUGH ASSOCIATION RULE MINING FOR IMPROVEMENT OF WEBSITE USABILITY
ISTANBUL UNIVERSITY JOURNAL OF ELECTRICAL & ELECTRONICS ENGINEERING YEAR VOLUME NUMBER : 2009 : 9 : 2 (1037-1046) EXTRACTION OF INTERESTING PATTERNS THROUGH ASSOCIATION RULE MINING FOR IMPROVEMENT OF WEBSITE
More informationTransforming Quantitative Transactional Databases into Binary Tables for Association Rule Mining Using the Apriori Algorithm
Transforming Quantitative Transactional Databases into Binary Tables for Association Rule Mining Using the Apriori Algorithm Expert Systems: Final (Research Paper) Project Daniel Josiah-Akintonde December
More informationMining Quantitative Maximal Hyperclique Patterns: A Summary of Results
Mining Quantitative Maximal Hyperclique Patterns: A Summary of Results Yaochun Huang, Hui Xiong, Weili Wu, and Sam Y. Sung 3 Computer Science Department, University of Texas - Dallas, USA, {yxh03800,wxw0000}@utdallas.edu
More informationMining Frequent Patterns without Candidate Generation
Mining Frequent Patterns without Candidate Generation Outline of the Presentation Outline Frequent Pattern Mining: Problem statement and an example Review of Apriori like Approaches FP Growth: Overview
More informationRoadmap. PCY Algorithm
1 Roadmap Frequent Patterns A-Priori Algorithm Improvements to A-Priori Park-Chen-Yu Algorithm Multistage Algorithm Approximate Algorithms Compacting Results Data Mining for Knowledge Management 50 PCY
More informationAssociation-Rules-Based Recommender System for Personalization in Adaptive Web-Based Applications
Association-Rules-Based Recommender System for Personalization in Adaptive Web-Based Applications Daniel Mican, Nicolae Tomai Babes-Bolyai University, Dept. of Business Information Systems, Str. Theodor
More informationMining Spatial Gene Expression Data Using Association Rules
Mining Spatial Gene Expression Data Using Association Rules M.Anandhavalli Reader, Department of Computer Science & Engineering Sikkim Manipal Institute of Technology Majitar-737136, India M.K.Ghose Prof&Head,
More informationThe Fuzzy Search for Association Rules with Interestingness Measure
The Fuzzy Search for Association Rules with Interestingness Measure Phaichayon Kongchai, Nittaya Kerdprasop, and Kittisak Kerdprasop Abstract Association rule are important to retailers as a source of
More informationData Mining Part 3. Associations Rules
Data Mining Part 3. Associations Rules 3.2 Efficient Frequent Itemset Mining Methods Fall 2009 Instructor: Dr. Masoud Yaghini Outline Apriori Algorithm Generating Association Rules from Frequent Itemsets
More informationMining of Web Server Logs using Extended Apriori Algorithm
International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) International Journal of Emerging Technologies in Computational
More informationAn Efficient Reduced Pattern Count Tree Method for Discovering Most Accurate Set of Frequent itemsets
IJCSNS International Journal of Computer Science and Network Security, VOL.8 No.8, August 2008 121 An Efficient Reduced Pattern Count Tree Method for Discovering Most Accurate Set of Frequent itemsets
More informationFast Discovery of Sequential Patterns Using Materialized Data Mining Views
Fast Discovery of Sequential Patterns Using Materialized Data Mining Views Tadeusz Morzy, Marek Wojciechowski, Maciej Zakrzewicz Poznan University of Technology Institute of Computing Science ul. Piotrowo
More informationDiscovering the Association Rules in OLAP Data Cube with Daily Downloads of Folklore Materials *
Discovering the Association Rules in OLAP Data Cube with Daily Downloads of Folklore Materials * Galina Bogdanova, Tsvetanka Georgieva Abstract: Association rules mining is one kind of data mining techniques
More informationInternational Conference on Advances in Mechanical Engineering and Industrial Informatics (AMEII 2015)
International Conference on Advances in Mechanical Engineering and Industrial Informatics (AMEII 2015) The Improved Apriori Algorithm was Applied in the System of Elective Courses in Colleges and Universities
More informationInduction of Association Rules: Apriori Implementation
1 Induction of Association Rules: Apriori Implementation Christian Borgelt and Rudolf Kruse Department of Knowledge Processing and Language Engineering School of Computer Science Otto-von-Guericke-University
More information620 HUANG Liusheng, CHEN Huaping et al. Vol.15 this itemset. Itemsets that have minimum support (minsup) are called large itemsets, and all the others
Vol.15 No.6 J. Comput. Sci. & Technol. Nov. 2000 A Fast Algorithm for Mining Association Rules HUANG Liusheng (ΛΠ ), CHEN Huaping ( ±), WANG Xun (Φ Ψ) and CHEN Guoliang ( Ξ) National High Performance Computing
More informationA New Technique to Optimize User s Browsing Session using Data Mining
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 4, Issue. 3, March 2015,
More informationA Modified Apriori Algorithm for Fast and Accurate Generation of Frequent Item Sets
INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 6, ISSUE 08, AUGUST 2017 ISSN 2277-8616 A Modified Apriori Algorithm for Fast and Accurate Generation of Frequent Item Sets K.A.Baffour,
More informationA Novel Texture Classification Procedure by using Association Rules
ITB J. ICT Vol. 2, No. 2, 2008, 03-4 03 A Novel Texture Classification Procedure by using Association Rules L. Jaba Sheela & V.Shanthi 2 Panimalar Engineering College, Chennai. 2 St.Joseph s Engineering
More informationA Decremental Algorithm for Maintaining Frequent Itemsets in Dynamic Databases *
A Decremental Algorithm for Maintaining Frequent Itemsets in Dynamic Databases * Shichao Zhang 1, Xindong Wu 2, Jilian Zhang 3, and Chengqi Zhang 1 1 Faculty of Information Technology, University of Technology
More informationLecture 2 Wednesday, August 22, 2007
CS 6604: Data Mining Fall 2007 Lecture 2 Wednesday, August 22, 2007 Lecture: Naren Ramakrishnan Scribe: Clifford Owens 1 Searching for Sets The canonical data mining problem is to search for frequent subsets
More informationWeb Page Classification using FP Growth Algorithm Akansha Garg,Computer Science Department Swami Vivekanad Subharti University,Meerut, India
Web Page Classification using FP Growth Algorithm Akansha Garg,Computer Science Department Swami Vivekanad Subharti University,Meerut, India Abstract - The primary goal of the web site is to provide the
More informationA Modified Apriori Algorithm
A Modified Apriori Algorithm K.A.Baffour, C.Osei-Bonsu, A.F. Adekoya Abstract: The Classical Apriori Algorithm (CAA), which is used for finding frequent itemsets in Association Rule Mining consists of
More informationDiscovering interesting rules from financial data
Discovering interesting rules from financial data Przemysław Sołdacki Institute of Computer Science Warsaw University of Technology Ul. Andersa 13, 00-159 Warszawa Tel: +48 609129896 email: psoldack@ii.pw.edu.pl
More informationUnderstanding Rule Behavior through Apriori Algorithm over Social Network Data
Global Journal of Computer Science and Technology Volume 12 Issue 10 Version 1.0 Type: Double Blind Peer Reviewed International Research Journal Publisher: Global Journals Inc. (USA) Online ISSN: 0975-4172
More informationPerformance Analysis of Apriori Algorithm with Progressive Approach for Mining Data
Performance Analysis of Apriori Algorithm with Progressive Approach for Mining Data Shilpa Department of Computer Science & Engineering Haryana College of Technology & Management, Kaithal, Haryana, India
More informationData Mining: Mining Association Rules. Definitions. .. Cal Poly CSC 466: Knowledge Discovery from Data Alexander Dekhtyar..
.. Cal Poly CSC 466: Knowledge Discovery from Data Alexander Dekhtyar.. Data Mining: Mining Association Rules Definitions Market Baskets. Consider a set I = {i 1,...,i m }. We call the elements of I, items.
More informationData Mining of Web Access Logs Using Classification Techniques
Data Mining of Web Logs Using Classification Techniques Md. Azam 1, Asst. Prof. Md. Tabrez Nafis 2 1 M.Tech Scholar, Department of Computer Science & Engineering, Al-Falah School of Engineering & Technology,
More informationMining Quantitative Association Rules on Overlapped Intervals
Mining Quantitative Association Rules on Overlapped Intervals Qiang Tong 1,3, Baoping Yan 2, and Yuanchun Zhou 1,3 1 Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China {tongqiang,
More informationAn Algorithm for Mining Large Sequences in Databases
149 An Algorithm for Mining Large Sequences in Databases Bharat Bhasker, Indian Institute of Management, Lucknow, India, bhasker@iiml.ac.in ABSTRACT Frequent sequence mining is a fundamental and essential
More informationCHAPTER V ADAPTIVE ASSOCIATION RULE MINING ALGORITHM. Please purchase PDF Split-Merge on to remove this watermark.
119 CHAPTER V ADAPTIVE ASSOCIATION RULE MINING ALGORITHM 120 CHAPTER V ADAPTIVE ASSOCIATION RULE MINING ALGORITHM 5.1. INTRODUCTION Association rule mining, one of the most important and well researched
More informationAn Evolutionary Algorithm for Mining Association Rules Using Boolean Approach
An Evolutionary Algorithm for Mining Association Rules Using Boolean Approach ABSTRACT G.Ravi Kumar 1 Dr.G.A. Ramachandra 2 G.Sunitha 3 1. Research Scholar, Department of Computer Science &Technology,
More informationConcurrent Processing of Frequent Itemset Queries Using FP-Growth Algorithm
Concurrent Processing of Frequent Itemset Queries Using FP-Growth Algorithm Marek Wojciechowski, Krzysztof Galecki, Krzysztof Gawronek Poznan University of Technology Institute of Computing Science ul.
More informationAn Efficient Algorithm for Finding the Support Count of Frequent 1-Itemsets in Frequent Pattern Mining
An Efficient Algorithm for Finding the Support Count of Frequent 1-Itemsets in Frequent Pattern Mining P.Subhashini 1, Dr.G.Gunasekaran 2 Research Scholar, Dept. of Information Technology, St.Peter s University,
More informationBCB 713 Module Spring 2011
Association Rule Mining COMP 790-90 Seminar BCB 713 Module Spring 2011 The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Outline What is association rule mining? Methods for association rule mining Extensions
More informationOptimization using Ant Colony Algorithm
Optimization using Ant Colony Algorithm Er. Priya Batta 1, Er. Geetika Sharmai 2, Er. Deepshikha 3 1Faculty, Department of Computer Science, Chandigarh University,Gharaun,Mohali,Punjab 2Faculty, Department
More informationKnowledge Discovery from Web Usage Data: Research and Development of Web Access Pattern Tree Based Sequential Pattern Mining Techniques: A Survey
Knowledge Discovery from Web Usage Data: Research and Development of Web Access Pattern Tree Based Sequential Pattern Mining Techniques: A Survey G. Shivaprasad, N. V. Subbareddy and U. Dinesh Acharya
More informationSurvey Paper on Web Usage Mining for Web Personalization
ISSN 2278 0211 (Online) Survey Paper on Web Usage Mining for Web Personalization Namdev Anwat Department of Computer Engineering Matoshri College of Engineering & Research Center, Eklahare, Nashik University
More informationRoadmap DB Sys. Design & Impl. Association rules - outline. Citations. Association rules - idea. Association rules - idea.
15-721 DB Sys. Design & Impl. Association Rules Christos Faloutsos www.cs.cmu.edu/~christos Roadmap 1) Roots: System R and Ingres... 7) Data Analysis - data mining datacubes and OLAP classifiers association
More informationOutlier Detection Using Unsupervised and Semi-Supervised Technique on High Dimensional Data
Outlier Detection Using Unsupervised and Semi-Supervised Technique on High Dimensional Data Ms. Gayatri Attarde 1, Prof. Aarti Deshpande 2 M. E Student, Department of Computer Engineering, GHRCCEM, University
More informationOptimization of Query Processing in XML Document Using Association and Path Based Indexing
Optimization of Query Processing in XML Document Using Association and Path Based Indexing D.Karthiga 1, S.Gunasekaran 2 Student,Dept. of CSE, V.S.B Engineering College, TamilNadu, India 1 Assistant Professor,Dept.
More informationA Survey on Web Personalization of Web Usage Mining
A Survey on Web Personalization of Web Usage Mining S.Jagan 1, Dr.S.P.Rajagopalan 2 1 Assistant Professor, Department of CSE, T.J. Institute of Technology, Tamilnadu, India 2 Professor, Department of CSE,
More informationM.Kannan et al IJCSET Feb 2011 Vol 1, Issue 1,30-34
Genetic Data Mining With Divide-And- Conquer Strategy M.Kannan, P.Yasodha, V.Srividhya CSA Dept., SCSVMV University, Enathur, Kanchipuram - 631 561. Abstract: Data mining is most commonly used in attempts
More informationCarnegie Mellon Univ. Dept. of Computer Science /615 DB Applications. Data mining - detailed outline. Problem
Faloutsos & Pavlo 15415/615 Carnegie Mellon Univ. Dept. of Computer Science 15415/615 DB Applications Lecture # 24: Data Warehousing / Data Mining (R&G, ch 25 and 26) Data mining detailed outline Problem
More informationPerformance and Scalability: Apriori Implementa6on
Performance and Scalability: Apriori Implementa6on Apriori R. Agrawal and R. Srikant. Fast algorithms for mining associa6on rules. VLDB, 487 499, 1994 Reducing Number of Comparisons Candidate coun6ng:
More informationFinding Generalized Path Patterns for Web Log Data Mining
Finding Generalized Path Patterns for Web Log Data Mining Alex Nanopoulos and Yannis Manolopoulos Data Engineering Lab, Department of Informatics, Aristotle University 54006 Thessaloniki, Greece {alex,manolopo}@delab.csd.auth.gr
More informationData Structure for Association Rule Mining: T-Trees and P-Trees
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 16, NO. 6, JUNE 2004 1 Data Structure for Association Rule Mining: T-Trees and P-Trees Frans Coenen, Paul Leng, and Shakil Ahmed Abstract Two new
More informationData Mining: Concepts and Techniques. Chapter 5. SS Chung. April 5, 2013 Data Mining: Concepts and Techniques 1
Data Mining: Concepts and Techniques Chapter 5 SS Chung April 5, 2013 Data Mining: Concepts and Techniques 1 Chapter 5: Mining Frequent Patterns, Association and Correlations Basic concepts and a road
More informationAn Efficient Method of Web Sequential Pattern Mining Based on Session Filter and Transaction Identification
An Efficient Method of Web Sequential Pattern Mining Based on Session Filter and Transaction Identification Jingjun Zhu Department of Computer Science and Technology,Tsinghua University sillypig0206@gmail.com
More informationData mining - detailed outline. Carnegie Mellon Univ. Dept. of Computer Science /615 DB Applications. Problem.
Faloutsos & Pavlo 15415/615 Carnegie Mellon Univ. Dept. of Computer Science 15415/615 DB Applications Data Warehousing / Data Mining (R&G, ch 25 and 26) C. Faloutsos and A. Pavlo Data mining detailed outline
More informationUser Session Identification Using Enhanced Href Method
User Session Identification Using Enhanced Href Method Department of Computer Science, Constantine the Philosopher University in Nitra, Slovakia jkapusta@ukf.sk, psvec@ukf.sk, mmunk@ukf.sk, jskalka@ukf.sk
More informationOn Multiple Query Optimization in Data Mining
On Multiple Query Optimization in Data Mining Marek Wojciechowski, Maciej Zakrzewicz Poznan University of Technology Institute of Computing Science ul. Piotrowo 3a, 60-965 Poznan, Poland {marek,mzakrz}@cs.put.poznan.pl
More informationCS570 Introduction to Data Mining
CS570 Introduction to Data Mining Frequent Pattern Mining and Association Analysis Cengiz Gunay Partial slide credits: Li Xiong, Jiawei Han and Micheline Kamber George Kollios 1 Mining Frequent Patterns,
More informationTo Enhance Projection Scalability of Item Transactions by Parallel and Partition Projection using Dynamic Data Set
To Enhance Scalability of Item Transactions by Parallel and Partition using Dynamic Data Set Priyanka Soni, Research Scholar (CSE), MTRI, Bhopal, priyanka.soni379@gmail.com Dhirendra Kumar Jha, MTRI, Bhopal,
More informationThe influence of caching on web usage mining
The influence of caching on web usage mining J. Huysmans 1, B. Baesens 1,2 & J. Vanthienen 1 1 Department of Applied Economic Sciences, K.U.Leuven, Belgium 2 School of Management, University of Southampton,
More informationA Conflict-Based Confidence Measure for Associative Classification
A Conflict-Based Confidence Measure for Associative Classification Peerapon Vateekul and Mei-Ling Shyu Department of Electrical and Computer Engineering University of Miami Coral Gables, FL 33124, USA
More informationFrequent Item Set using Apriori and Map Reduce algorithm: An Application in Inventory Management
Frequent Item Set using Apriori and Map Reduce algorithm: An Application in Inventory Management Kranti Patil 1, Jayashree Fegade 2, Diksha Chiramade 3, Srujan Patil 4, Pradnya A. Vikhar 5 1,2,3,4,5 KCES
More informationData Access Paths for Frequent Itemsets Discovery
Data Access Paths for Frequent Itemsets Discovery Marek Wojciechowski, Maciej Zakrzewicz Poznan University of Technology Institute of Computing Science {marekw, mzakrz}@cs.put.poznan.pl Abstract. A number
More informationKeyword: Frequent Itemsets, Highly Sensitive Rule, Sensitivity, Association rule, Sanitization, Performance Parameters.
Volume 4, Issue 2, February 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Privacy Preservation
More informationStructure of Association Rule Classifiers: a Review
Structure of Association Rule Classifiers: a Review Koen Vanhoof Benoît Depaire Transportation Research Institute (IMOB), University Hasselt 3590 Diepenbeek, Belgium koen.vanhoof@uhasselt.be benoit.depaire@uhasselt.be
More informationIMPROVING APRIORI ALGORITHM USING PAFI AND TDFI
IMPROVING APRIORI ALGORITHM USING PAFI AND TDFI Manali Patekar 1, Chirag Pujari 2, Juee Save 3 1,2,3 Computer Engineering, St. John College of Engineering And Technology, Palghar Mumbai, (India) ABSTRACT
More informationChapter 6: Association Rules
Chapter 6: Association Rules Association rule mining Proposed by Agrawal et al in 1993. It is an important data mining model. Transaction data (no time-dependent) Assume all data are categorical. No good
More informationData Mining for Knowledge Management. Association Rules
1 Data Mining for Knowledge Management Association Rules Themis Palpanas University of Trento http://disi.unitn.eu/~themis 1 Thanks for slides to: Jiawei Han George Kollios Zhenyu Lu Osmar R. Zaïane Mohammad
More informationWIP: mining Weighted Interesting Patterns with a strong weight and/or support affinity
WIP: mining Weighted Interesting Patterns with a strong weight and/or support affinity Unil Yun and John J. Leggett Department of Computer Science Texas A&M University College Station, Texas 7783, USA
More informationComparatively Analysis of Fix and Dynamic Size Frequent Pattern discovery methods using in Web personalisation
Comparatively nalysis of Fix and Dynamic Size Frequent Pattern discovery methods using in Web personalisation irija Shankar Dewangan1, Samta ajbhiye2 Computer Science and Engineering Dept., SSCET Bhilai,
More informationA recommendation engine by using association rules
Available online at www.sciencedirect.com Procedia - Social and Behavioral Sciences 62 ( 2012 ) 452 456 WCBEM 2012 A recommendation engine by using association rules Ozgur Cakir a 1, Murat Efe Aras b a
More informationAssociation Rule Mining. Introduction 46. Study core 46
Learning Unit 7 Association Rule Mining Introduction 46 Study core 46 1 Association Rule Mining: Motivation and Main Concepts 46 2 Apriori Algorithm 47 3 FP-Growth Algorithm 47 4 Assignment Bundle: Frequent
More informationPTclose: A novel algorithm for generation of closed frequent itemsets from dense and sparse datasets
: A novel algorithm for generation of closed frequent itemsets from dense and sparse datasets J. Tahmores Nezhad ℵ, M.H.Sadreddini Abstract In recent years, various algorithms for mining closed frequent
More informationINFREQUENT WEIGHTED ITEM SET MINING USING FREQUENT PATTERN GROWTH R. Lakshmi Prasanna* 1, Dr. G.V.S.N.R.V. Prasad 2
ISSN 2277-2685 IJESR/Nov. 2015/ Vol-5/Issue-11/1434-1439 R. Lakshmi Prasanna et. al.,/ International Journal of Engineering & Science Research INFREQUENT WEIGHTED ITEM SET MINING USING FREQUENT PATTERN
More informationAn Apriori-like algorithm for Extracting Fuzzy Association Rules between Keyphrases in Text Documents
An Apriori-lie algorithm for Extracting Fuzzy Association Rules between Keyphrases in Text Documents Guy Danon Department of Information Systems Engineering Ben-Gurion University of the Negev Beer-Sheva
More informationTemporal Weighted Association Rule Mining for Classification
Temporal Weighted Association Rule Mining for Classification Purushottam Sharma and Kanak Saxena Abstract There are so many important techniques towards finding the association rules. But, when we consider
More informationWeb Usage Mining. Overview Session 1. This material is inspired from the WWW 16 tutorial entitled Analyzing Sequential User Behavior on the Web
Web Usage Mining Overview Session 1 This material is inspired from the WWW 16 tutorial entitled Analyzing Sequential User Behavior on the Web 1 Outline 1. Introduction 2. Preprocessing 3. Analysis 2 Example
More informationFUZZY COGNITIVE MAPS: A SOFT COMPUTING
Proceedings of the 15th IEEE lntemational Symposium on Intelligent Control (ISIC 2000) Rio, Patras, GREECE 17-1 9 uly 2000 FUZZY COGNITIVE MAPS: A SOFT COMPUTING TECHNIQUE FOR INTELLIGENT CONTROL CHRYSOSTOMOS
More informationAssociating Terms with Text Categories
Associating Terms with Text Categories Osmar R. Zaïane Department of Computing Science University of Alberta Edmonton, AB, Canada zaiane@cs.ualberta.ca Maria-Luiza Antonie Department of Computing Science
More informationCLOSET+:Searching for the Best Strategies for Mining Frequent Closed Itemsets
CLOSET+:Searching for the Best Strategies for Mining Frequent Closed Itemsets Jianyong Wang, Jiawei Han, Jian Pei Presentation by: Nasimeh Asgarian Department of Computing Science University of Alberta
More informationUsing Pattern-Join and Purchase-Combination for Mining Web Transaction Patterns in an Electronic Commerce Environment
Using Pattern-Join and Purchase-Combination for Mining Web Transaction Patterns in an Electronic Commerce Environment Ching-Huang Yun and Ming-Syan Chen Department of Electrical Engineering National Taiwan
More information