1,000,024 Hits in 7.3 sec

Finding Good Subtrees for Constraint Optimization Problems Using Frequent Pattern Mining

Hongbo Li, Jimmy Lee, He Mi, Minghao Yin
In this paper, we propose a method employing frequent pattern mining (FPM), a classic datamining technique, to find good subtrees for solving constraint optimization problems.  ...  Exploring the identified subtrees first, the method brings substantial improvements for four efficient search strategies in both total runtime and runtime of finding optimal solutions.  ...  Acknowledgments The authors thank Anthony Palmieri and Guillaume Perez for sharing the source codes of Objective-Based Selector.  ... 
doi:10.1609/aaai.v34i02.5518 fatcat:g226snj43nb2vgctv65dx6dmru

Genetic-Fuzzy Data Mining With Divide-and-Conquer Strategy

Tzung-Pei Hong, Chun-Hao Chen, Yeong-Chyi Lee, Yu-Lung Wu
2008 IEEE Transactions on Evolutionary Computation  
A genetic algorithm (GA)-based framework for finding membership functions suitable for mining problems is proposed.  ...  This paper, thus, proposes a fuzzy data-mining algorithm for extracting both association rules and membership functions from quantitative transactions.  ...  Each individual in the first population is a set of membership functions for item milk.  ... 
doi:10.1109/tevc.2007.900992 fatcat:apl7s2ebgzfcrddxa6slaadaay

Page 1039 of The Journal of the Operational Research Society Vol. 57, Issue 9 [page]

2006 The Journal of the Operational Research Society  
The first heuristic, called Single component strategy (SCS), starts with making the best individual schedules for each of the routine works.  ...  First, we make a schedule for the most frequent work. Then the other works are scheduled such that the increase in the overall cost is minimal.  ... 

CBW: an efficient algorithm for frequent itemset mining

Ja-Hwung Su, Wen-Yang Lin
2004 37th Annual Hawaii International Conference on System Sciences, 2004. Proceedings of the  
Frequent itemset generation is the prerequisite and most time-consuming process for association rule mining.  ...  In this paper, we propose a new algorithm that maintains its performance even at relative low supports.  ...  Since the second phase is straightforward and less expensive, we concentrate only on the first phase for finding all frequent itemsets.  ... 
doi:10.1109/hicss.2004.1265202 dblp:conf/hicss/SuL04 fatcat:ky5h6nj6yraanhb2dmuefhosrq

Entity Search Strategies for Mashup Applications

Stefan Endrullis, Andreas Thor, Erhard Rahm
2012 2012 IEEE 28th International Conference on Data Engineering  
We therefore propose more advanced search strategies that aim at finding a set of entities with high efficiency and high effectiveness.  ...  We introduce a flexible model for entity search strategies that includes a ranking of candidate queries determined by different query generators.  ...  The entities covered by a frequent value set form a subset I j for which one query is generated.  ... 
doi:10.1109/icde.2012.84 dblp:conf/icde/EndrullisTR12 fatcat:4kssl4mkyngr3ndi7th3gnd24m

When data mining meets optimization: A case study on the quadratic assignment problem [article]

Yangming Zhou, Jin-Kao Hao, Béatrice Duval
2017 arXiv   pre-print
The proposed method uses a data mining procedure to mine frequent patterns from a set of high-quality solutions collected from previous search, and the mined frequent patterns are then employed to build  ...  This paper presents a hybrid approach called frequent pattern based search that combines data mining and optimization.  ...  First, FPBS-QAP achieves all best-known values except two cases while BLS and BMA fail to find the best-known values for five instances.  ... 
arXiv:1708.05214v2 fatcat:y3jjdbq3fzcjhjcgenkhlbcfqa

Pattern lattice traversal by selective jumps

Osmar R. Zaïane, Mohammad El-Hajj
2005 Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining - KDD '05  
Regardless of the frequent patterns to discover, either the full frequent patterns or the condensed ones, either closed or maximal, the strategy always includes the traversal of the lattice of candidate  ...  We study the existing depth versus breadth traversal approaches for generating candidate patterns and propose in this paper a new traversal approach that jumps in the search space among only promising  ...  No work has been done to find new traversal strategies, such as greedy ones, or best first, etc.  ... 
doi:10.1145/1081870.1081964 dblp:conf/kdd/ZaianeE05 fatcat:ff3kruf24jg6toqtu4qlfjy2gu

Parallel leap: large-scale maximal pattern mining in a distributed environment

M. El-Hajj, O.R. Zaiane
2006 12th International Conference on Parallel and Distributed Systems - (ICPADS'06)  
In this work we propose a method that combines both strategies efficiently, i.e. mining in parallel for the set of maximal patterns which, to the best of our knowledge, has never been proposed efficiently  ...  Many approaches have been suggested such as sequential mining for maximal patterns or searching for all frequent patterns in parallel.  ...  Finding the set of frequent patterns is the first step in finding association rules. Once frequent itemsets are known, generating the association rules is trivial.  ... 
doi:10.1109/icpads.2006.77 dblp:conf/icpads/El-HajjZ06 fatcat:4x5m3ythobd4jfwa363b77qmra

Strategic Market Choice: Frequent Call Markets vs. Continuous Double Auctions for Fast and Slow Traders

Elaine Wah, Dylan Hurd, Michael Wellman
2015 Proceedings of the The Third Conference on Auctions, Market Mechanisms and Their Applications  
We also analyze best-response patterns to characterize the frequent call market's basin of attraction.  ...  We also find strong evidence of a predator-prey relation between fast and slow traders: the fast traders chase agents into either market, and slow traders under pursuit seek the protection of the frequent  ...  Acknowledgments We are grateful to Jacob Abernethy, Michael Barr, and Uday Rajan for helpful feedback, and to the anonymous reviewers for their suggestions.  ... 
doi:10.4108/eai.8-8-2015.2260356 dblp:journals/sg/WahHW16 fatcat:f6dstbtnvrfzjgsiapcpgepp64

Impacts of Pheromone Modification Strategies in Ant Colony for Data-Intensive Service Provision

Lijuan Wang, Jun Shen, Junzhou Luo
2014 2014 IEEE International Conference on Web Services  
to find a new solution for the changed scenarios.  ...  to find a new solution for the changed scenarios.  ...  Then the ants need to find a solution for the new scenario between 51-th iteration and 100-th iteration and let f i be the iteration where the best utility for the new scenario presents first time.  ... 
doi:10.1109/icws.2014.36 dblp:conf/icws/WangSL14 fatcat:3jajjkmbszbcjpgala467ablem

Local Predictions for Case-Based Plan Recognition [chapter]

Boris Kerkez, Michael T. Cox
2002 Lecture Notes in Computer Science  
We show that the first method is better than a baseline random prediction, that the second method is an improvement over the first, and that the second and the third methods combined are the best overall  ...  strategy.  ...  Acknowledgments This paper is supported by the Dayton Area Graduate Studies Institute (DAGSI) under grant #HE-WSU-99-09 (ABMIC), by a grant from the Information Technology Research Institute (ITRI), and  ... 
doi:10.1007/3-540-46119-1_15 fatcat:joylmpabdnffnbi5flhodwdh3e

Implementing leap traversals of the itemset lattice

Mohammad El-Hajj, Osmar R. Zaïane
2005 Proceedings of the 1st international workshop on open source data mining frequent pattern mining implementations - OSDM '05  
The first one uses a simple header-less frequent pattern tree and the second one partitions the transaction space using COFI-trees.  ...  In this paper we discuss how to avoid nodes in the lattice that would not participate in the answer set and hence drastically reduce the number of candidates to test out.  ...  No work has been done to find new traversal strategies, such as greedy ones, or best first, etc.  ... 
doi:10.1145/1133905.1133909 fatcat:hr2g6jvo2jckvmhs4cddq2ty4e

A hybrid data mining GRASP with path-relinking

Hugo Barbalho, Isabel Rosseti, Simone L. Martins, Alexandre Plastino
2013 Computers & Operations Research  
In the hybrid GRASP proposal, after executing a significant number of iterations, the data mining process extracts patterns from an elite set of sub-optimal solutions for the optimization problem.  ...  In this work, we show that, not only the traditional GRASP, but also GRASP improved with the path-relinking heuristic-a memory-based intensification strategy-could benefit from exploring a data mining  ...  First, the computational effort of the adapted construction phase is smaller than the original construction, since a smaller set of edges is processed to find a 2-path for each pair.  ... 
doi:10.1016/j.cor.2012.02.022 fatcat:ibzxmkd3n5hgzjuxo6dsrk4rne

Discovering Unbounded Episodes in Sequential Data [chapter]

Gemma Casas-Garriga
2003 Lecture Notes in Computer Science  
One basic goal in the analysis of time-series data is to find frequent interesting episodes, i.e, collections of events occurring frequently together in the input sequence.  ...  We present in this paper, a more intuitive definition that allows, in turn, interesting episodes to grow during the mining without any user-specified help.  ...  For better understanding, we give a brief account of how our Best-First strategy works.  ... 
doi:10.1007/978-3-540-39804-2_10 fatcat:2crxwh5vvjctjbzsa4lqrz5y2m


Daljeet Kaur
2017 International Journal of Advanced Research in Computer Science  
The findings of these correlations can help the retailers to establish a profitable sales strategy by considering frequently purchased items together by customers.  ...  Supermarket analysis is a process to analyze the buyer's habits to discover the correlations between the different items in their shopping cart.  ...  IV APRIORI ALGORITHM This algorithm has been often utilized for mining of frequent item sets and to find associations.  ... 
doi:10.26483/ijarcs.v8i7.4564 fatcat:z74ckldrcjhehglyaumrfinxfi
« Previous Showing results 1 — 15 out of 1,000,024 results