Filters








112,201 Hits in 8.7 sec

Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach

Jiawei Han, Jian Pei, Yiwen Yin, Runying Mao
2004 Data mining and knowledge discovery  
mining adopts a pattern-fragment growth method to avoid the costly generation of a large number of candidate sets, and (3) a partitioning-based, divide-and-conquer method is used to decompose the mining  ...  Most of the previous studies adopt an Apriori-like candidate set generation-and-test approach.  ...  One such study has been performed by us in .  ... 
doi:10.1023/b:dami.0000005258.31418.83 fatcat:rjtq6e2vwfgr3awbjlp4piuuma

A novel approach for privacy mining of generic basic association rules

Moez Waddey, Pascal Poncelet, Sadok Ben Yahia
2009 Proceeding of the ACM first international workshop on Privacy and anonymity for very large databases - PAVLAD '09  
This paper presents a new scalable algorithm for discovering closed frequent itemsets in distributed environment, using commutative encryption to ensure privacy concerns.  ...  The irony is that data mining results rarely violate privacy. The objective of data mining is to generalize across populations rather than reveal information about individuals [10].  ...  Section 3 describes our approach, which can generate the generic base of association rules from the frequent closed set in a distributed environment while preserving the constraints of privacy by using  ... 
doi:10.1145/1651449.1651459 dblp:conf/cikm/WaddeyPY09 fatcat:bnpc37rejzgwpdoylm434styd4

A Novel Approach for Association Rule Mining using Pattern Generation

Deepa S. Deshpande
2014 International Journal of Information Technology and Computer Science  
First, patterns are generated using items from the transaction database. Second, frequent item set is obtained using these patterns. Finally association rules are derived.  ...  Therefore in order to decrease the multiple scanning of database, a new method of association rule mining using pattern generation is proposed in this paper. This method involves three steps.  ...  It uses a breadth first search approach, first finding all frequent 1-item set and then discovering frequent 2itemset and continues by finding increasingly larger frequent item sets.  ... 
doi:10.5815/ijitcs.2014.11.09 fatcat:qvv26o4m6ra5doggmrucvp75fm

Privacy-Aware Market Basket Data Set Generation: A Feasible Approach for Inverse Frequent Set Mining [chapter]

Xintao Wu, Ying Wu, Yongge Wang, Yingjiu Li
2005 Proceedings of the 2005 SIAM International Conference on Data Mining  
In this paper, we propose a feasible solution to the NPcomplete problem of inverse frequent set mining.  ...  The results show that our approach is effective and efficient for reconstructing market basket data set from a given set of frequent itemsets while preserving sensitive information.  ...  We would also like to thank IBM Almaden Quest group for providing the market basket data generator.  ... 
doi:10.1137/1.9781611972757.10 dblp:conf/sdm/WuWWL05 fatcat:hlin56o3urgihnlxl3355hjztu

Decomposing Petri nets for process mining: A generic approach

Wil M. P. van der Aalst
2013 Distributed and parallel databases  
Existing process mining techniques have problems dealing with large event logs referring to many different activities. Therefore, we propose a generic approach to decompose process mining problems.  ...  The decomposition approach is generic and can be combined with different existing process discovery and conformance checking techniques.  ...  For example, one can mine for frequent item sets to find activities that often happen together.  ... 
doi:10.1007/s10619-013-7127-5 fatcat:c6s3v7u2s5hqtljtd6dikxcjzi

A General Approach to Mining Quality Pattern-Based Clusters from Microarray Data [chapter]

Daxin Jiang, Jian Peii, Aidong Zhang
2005 Lecture Notes in Computer Science  
We examine our quality-driven approach using real world microarray data sets. The experimental results show that our method is general, effective and efficient.  ...  In this paper, we address the above two problems by proposing a general quality-driven approach to mining top-k quality pattern-based clusters.  ...  A general quality-driven model is introduced in Section 3. A general approach to mining top-k quality pattern-based clusters is presented in Section 4.  ... 
doi:10.1007/11408079_18 fatcat:xrphod7f3rda3gt55xtndvqywu

A hierarchical approach for generating regular floorplans

Javier de San Pedro, Jordi Cortadella, Antoni Roca
2014 2014 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)  
In this work we introduce HiReg, a new floorplanning algorithm that generates regular floorplans. HiReg automatically extracts repeating patterns in a design by using graph mining techniques.  ...  Regularity is exploited by reusing the same floorplan for multiple instances of a pattern, as long as neither area, wire length or existing hierarchy constraints are violated or compromised.  ...  In general, each tile may have a different area constraint.  ... 
doi:10.1109/iccad.2014.7001422 dblp:conf/iccad/PedroCR14 fatcat:rjulae6gznbhpjqm6r5r3g5hae

Mine your own business, mine others' news!

Quang-Khai Pham, Regis Saint-Paul, Boualem Benatallah, Noureddine Mouaddib, Guillaume Raschia
2008 Proceedings of the 11th international conference on Extending database technology Advances in database technology - EDBT '08  
We experimented the whole framework on a set of news data from Reuters.  ...  In this demonstration, we show how the mining task is supported by the use of a Time-Aware Content Summarization algorithm (TACS).  ...  The results on both data sets will of course be different, but these results will allow us to open a discussion the benefits of our TACS approach for supporting such applications.  ... 
doi:10.1145/1353343.1353436 dblp:conf/edbt/PhamSBMR08 fatcat:yhp5sl3vsndj3hurvhx4tex5l4

Mine your own business, mine others' news!

Quang-Khai Pham, Regis Saint-Paul, Boualem Benatallah, Noureddine Mouaddib, Guillaume Raschia
2008 Proceedings of the 11th international conference on Extending database technology Advances in database technology - EDBT '08  
We experimented the whole framework on a set of news data from Reuters.  ...  In this demonstration, we show how the mining task is supported by the use of a Time-Aware Content Summarization algorithm (TACS).  ...  The results on both data sets will of course be different, but these results will allow us to open a discussion the benefits of our TACS approach for supporting such applications.  ... 
doi:10.1145/1352431.1352524 fatcat:ryfpi6herzcavkj6f3cbbustte

A General Introspective Reasoning Approach to Web Search for Case Adaptation [chapter]

David Leake, Jay Powell
2010 Lecture Notes in Computer Science  
The WebAdapt system [20] applies an alternative approach to acquiring case knowledge, using a knowledge planning process to mine it as needed from Web sources.  ...  This paper presents two extensions to WebAdapt's approach, aimed at increasing the method's generality and ease of application to new domains.  ...  Experimental Design for Question 3 (Generality of approach): A random set of forty-eight features from each domain were chosen for adaptation; this same set of features was used for each trial.  ... 
doi:10.1007/978-3-642-14274-1_15 fatcat:nlf4ly5kjja6tk7ig6qji5evbm

A Generic Pattern Matching Approach for Multiple Events
IJARCCE - Computer and Communication Engineering

R. PRADEEPA, L. SHARMILA
2014 IJARCCE  
Data mining is a highly evolving and developing frontier in data and information systems and their applications.  ...  Its a concept of extracting data from large data set and converts into understandable format. Automated prospective analysis and knowledge driven decisions make data more proactive.  ...  Our approach drives on a simpler trouble where events do not have excessive attributes, and this allows us to generate simpler algorithms.i.e, in accordance with the reputation of events is supported by  ... 
doi:10.17148/ijarcce.2014.31128 fatcat:agcrmotdpzdcll6rqk66h34cri

Discovering colocation patterns from spatial data sets: a general approach

Y. Huang, S. Shekhar, H. Xiong
2004 IEEE Transactions on Knowledge and Data Engineering  
In this paper, we provide a transaction-free approach to mine colocation patterns by using the concept of proximity neighborhood.  ...  Given a collection of Boolean spatial features, the colocation pattern discovery process finds the subsets of features frequently located together.  ...  Synthetic data sets are generated using a methodology similar to methodologies used to evaluate algorithms for mining association rules [2] .  ... 
doi:10.1109/tkde.2004.90 fatcat:yg3zwly6rfcwhm3q7hhvmnqjbu

LC-mine: a framework for frequent subgraph mining with local consistency techniques

Brahim Douar, Michel Liquiere, Chiraz Latiri, Yahya Slimani
2014 Knowledge and Information Systems  
In this paper, our purpose is to present LC-mine, a generic and efficient framework to mine frequent subgraphs by the means of local consistency techniques used in the constraint programming field.  ...  LC-mine: a framework for frequent subgraph mining with local consistency techniques.  ...  In this paper, our purpose is to present LC-mine, a generic and efficient framework to mine frequent subgraphs by the means of local consistency techniques used in the constraint programming field [20  ... 
doi:10.1007/s10115-014-0769-4 fatcat:5loij2mbabd47bbq5ff4j62yje

A two-level approach to generate synthetic argumentation reports

Patrick Saint-Dizier, Floriana Grasso, Nancy L. Green
2018 Argument & Computation  
We propose a two-level approach: a synthesis of the propositions that have been mined, and navigation facilities that allow users to access arguments, structured in clusters, in order to get more details  ...  Based on the Generative Lexicon (GL) Qualia Structure, which is a kind of lexical and knowledge repository, that we have enhanced in different manners and associated with inferences and language patterns  ...  The generation of clusters proceeds as follows: (1) Each concept defines a cluster that contains the mined arguments that have this concept in their 'conceptsInvolved' attribute, with the constraint that  ... 
doi:10.3233/aac-180035 fatcat:4fylswcauzfgxereirgsln4tbq

Association mining

Aaron Ceglar, John F. Roddick
2006 ACM Computing Surveys  
This survey focuses on the fundamental principles of association mining, that is, itemset identification, rule generation, and their generic optimizations.  ...  This article presents a survey of association mining fundamentals, detailing the evolution of association mining algorithms from the seminal to the state-of-the-art.  ...  A-Close [Pasquier et al. 1999b ] uses a candidate generation BFT approach consisting of two stages, generator set discovery and closed set derivation.  ... 
doi:10.1145/1132956.1132958 fatcat:37cmcoy7m5gbxadyzxozkcszea
« Previous Showing results 1 — 15 out of 112,201 results