Rough particle swarm optimization and its applications in data mining
Soft ComputingPublished 21 February 2008
Bilal Alataş, Erhan Akın
Citations73
SJR quartileQ2
SJR score0.67
SNIP1.04
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Various operators and evaluation measures that can be used in RPSOA have been described and efficiently utilized in data mining applications, especially in automatic mining of numeric association rules which is a hard problem.
Abstract
This paper proposes a novel particle swarm optimization algorithm, rough particle swarm optimization algorithm (RPSOA), based on the notion of rough patterns that use rough values defined with upper and lower intervals that represent a range or set of values. In this paper, various operators and evaluation measures that can be used in RPSOA have been described and efficiently utilized in data mining applications, especially in automatic mining of numeric association rules which is a hard problem.
Keywords
Computer Science
Particle swarm optimization
47,523 Citations2002James Kennedy, R.C. Eberhart
Journal of Global OptimizationDifferential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces
28,706 Citations1997Rainer Storn, Kenneth V. Price
It is demonstrated that the new heuristic approach for minimizing possibly nonlinear and non-differentiable continuous spacefunctions Converges faster and with more certainty than manyother acclaimed global optimization methods.
Mining association rules between sets of items in large databases
14,720 Citations1993Rakesh Agrawal, Tomasz Imieliński +1 more
An efficient algorithm is presented that generates all significant association rules between items in the database of customer transactions and incorporates buffer management and novel estimation and pruning techniques.
A modified particle swarm optimizer
10,157 Citations2002Yibing Shi, R.C. Eberhart
A new parameter, called inertia weight, is introduced into the original particle swarm optimizer, which resembles a school of flying birds since it adjusts its flying according to its own flying experience and its companions' flying experience.
Lecture notes in computer scienceParameter selection in particle swarm optimization
3,505 Citations1998Yuhui Shi, Russell C. Eberhart
This paper first analyzes the impact that inertia weight and maximum velocity have on the performance of the particle swarm optimizer, and then provides guidelines for selecting these two parameters.
Storing and querying ordered XML using a relational database system
2,248 Citations2002Igor Tatarinov, Stratis D. Viglas +4 more
This paper shows that XML's ordered data model can indeed be efficiently supported by a relational database system, and proposes three order encoding methods that can be used to represent XML order in the relational data model, and also proposes algorithms for translating ordered XPath expressions into SQL using these encoding methods.
Ant colony optimization: a new meta-heuristic
2,126 Citations2003Marco Dorigo, Gianni A. Di
This work defines the Ant Colony Optimization (ACO) meta-heuristic by defining these algorithms in a common framework by defining the foraging behavior of ant colonies as a meta- heuristic.
Machine LearningVery Simple Classification Rules Perform Well on Most Commonly Used Datasets
1,798 Citations1993Robert C. Holte
On most datasets studied, the best of very simple rules that classify examples on the basis of a single attribute is as accurate as the rules induced by the majority of machine learning systems.
Medical Entomology and ZoologyOn Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms
1,514 Citations1989Pablo Moscato
IEEE Transactions on Knowledge and Data EngineeringDatabase mining: a performance perspective
1,488 Citations1993R. K. Agrawal, Tomasz Imieliński +1 more
The authors' perspective of database mining as the confluence of machine learning techniques and the performance emphasis of database technology is presented and an algorithm for classification obtained by combining the basic rule discovery operations is given.
Mining quantitative association rules in large relational tables
1,484 Citations1996Ramakrishnan Srikant, Rakesh Agrawal
This work deals with quantitative attributes by fine-partitioning the values of the attribute and then combining adjacent partitions as necessary and introduces measures of partial completeness which quantify the information lost due to partitioning.
Munich Personal RePEc Archive (Ludwig Maximilian University of Munich)Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning
1,313 Citations1994Shummet Baluja
This paper presents an empirical analysis of where the proposed technique will outperform genetic algorithms, and describes a class of problems in which a genetic algorithm may be able to perform better.
Research Commons (The University of Waikato)Generating Accurate Rule Sets Without Global Optimization
1,284 Citations1998Eibe Frank, Ian H. Witten
This paper presents an algorithm for inferring rules by repeatedly generating partial decision trees, thus combining the two major paradigms for rule generation—creating rules from decision trees and the separate-and-conquer rule-learning technique.
Evolutionary computation
784 Citations2007Kenneth De Jong
An overview of a general EC framework that can help compare and contrast approaches, encourages crossbreeding, and facilitates intelligent design choices is given.
Journal of Global OptimizationAn Electromagnetism-like Mechanism for Global Optimization
743 Citations2003Ş İlker Birbil, Shu-Chering Fang
The ease of implementation and flexibility of the heuristic show the potential of this new approach, which utilizes an attraction-repulsion mechanism to move the sample points towards the optimality.
Clustering association rules
376 Citations2002Brian Lent, A. Swami +1 more
The authors present a geometric-based algorithm, BitOp, for performing the clustering, embedded within an association rule clustering system, ARCS, and measure the quality of the segmentation generated by ARCS using the minimum description length (MDL) principle of encoding the clusters on several databases.
Scatter search
298 Citations2003Fred Glover, Manuel Laguna +1 more
Data mining using two-dimensional optimized association rules
267 Citations1996Takeshi Fukuda, Yasukiko Morimoto +2 more
This work discusses data mining based on association rules for two numeric attributes and one Boolean attribute, which implies that bank customers whose ages and balances fall in a planar region P tend to use card loan with a high probability.
Association rules over interval data
266 Citations1997Renée J. Miller, Yusheng Yang
An algorithm for mining association rules under the new definition of interest for association rules that takes into account the semantics of interval data is developed and the experience using the algorithm on large real-life datasets is overview.
Journal of Intelligent Information SystemsInduction of ripple-down rules applied to modeling large databases
233 Citations1995Brian R. Gaines, Paul Compton
A methodology for the modeling of large data sets is described which results in rule sets having minimal inter-rule interactions, and being simply maintained.
Mining optimized association rules for numeric attributes
215 Citations1996Takeshi Fukuda, Yasuhido Morimoto +2 more
Given a huge database, the problem of finding rules for numeric attributes, such as(Balance # I)O(CardLoan=yes), is addressed, which implies that bank customers whose balances fall in a range I are likely to use card loan with a probability greater than p.
Applied Soft ComputingMODENAR: Multi-objective differential evolution algorithm for mining numeric association rules
200 Citations2007Bilal Alataş, Erhan Akın +1 more
A Pareto-based multi-objective differential evolution (DE) algorithm is proposed as a search strategy for mining accurate and comprehensible numeric association rules (ARs) which are optimal in the wider sense that no other rules are superior to them when all objectives are simultaneously considered.
Fuzzy Sets and SystemsGenetic algorithm based framework for mining fuzzy association rules
133 Citations2004Mehmet Kaya, R. Alhajj
An automated method for mining fuzzy association rules using a genetic algorithm (GA) based clustering method that adjusts centroids of the clusters, which are to be handled later as midpoints of triangular membership functions.
Journal of Intelligent Information SystemsA Statistical Theory for Quantitative Association Rules
119 Citations2003Yonatan Aumann, Yehuda Lindell
A new definition of quantitative association rules based on statistical inference theory is introduced, reflecting the intuition that the goal of association rules is to find extraordinary and therefore interesting phenomena in databases.
Quantminer: A genetic algorithm for mining quantitative association rules
113 Citations2008Ansaf Salleb-Aouissi, Christel Vrain +1 more
QUANTMINER, a mining quantitative association rules system based on a genetic algorithm that dynamically discovers "good" intervals in association rules by optimizing both the support and the confidence, is proposed.
Natural computing seriesScatter Search
111 Citations2003Fred Glover, Manuel Laguna +1 more
The main goal of this chapter is to demonstrate the development of a scatter search procedure by demonstrating how it may be applied to a class of non-linear optimisation problems on bounded variables.
Soft ComputingAn efficient genetic algorithm for automated mining of both positive and negative quantitative association rules
102 Citations2005Bilal Alataş, Erhan Akın
An adaptive mutation probability, a new operator called uniform operator that ensures the genetic diversity, and an efficient adjusted fitness function are used for mining all interesting ARs from the last population in only single run of GA.
Lecture notes in computer scienceDiscovering Numeric Association Rules via Evolutionary Algorithm
88 Citations2002Jacinto Mata Vázquez, José Luis Álvarez Macías +1 more
This paper uses an evolutionary algorithm to find the intervals of each attribute that conforms a frequent itemset within the database and evaluates the tool with synthetic and real databases to check the efficiency of the algorithm.
Journal of Computer and System SciencesMining Optimized Association Rules for Numeric Attributes
88 Citations1999Takeshi Fukuda, Yasuhiko Morimoto +2 more
The MIT Press eBooksUsing Cultural Algorithms for Constraint Handling in GENOCOP
70 Citations1995Robert G. Reynolds, Zbigniew Michalewicz +1 more
This research investigates the extension of a GA-based software package GENOCOP to deal with heavily constrained continuous numerical optimization problems and suggests the potential benefits of storing global generalizations of individual experience when solving problems with constraints.
Computing optimized rectilinear regions for association rules
55 Citations1997Kunikazu Yoda, Takeshi Fukuda +3 more
Experimental tests confirm that the rectilinear region less overfits a training database and thefore provides a better prediction for unseen test data, and a novel efficient algorithm for computing optimized rectilInear regions is presented.
International Journal of Computational Intelligence and ApplicationsA TRUE ANNEALING APPROACH TO THE MARRIAGE IN HONEY-BEES OPTIMIZATION ALGORITHM
50 Citations2003Jason Teo, Hussein A. Abbass
The overall performance of the MBO algorithm was found to have improved significantly using the proposed annealing function, and a dramatic improvement was noted with the committee machine using this true annealed approach.
Meaningful discretization of continuous features for association rules mining by means of a SOM.
41 Citations2004Marco Vannucci, Valentina Colla
A method based on the use of a SOM is presented and tested over various real world datasets to overcome limitations of the unsupervised dis- cretization of continuous attributes for association rules mining.
Competitive Approaches to PSO Algorithms via New Acceleration Co-Efficient Variant with Mutation Operators
40 Citations2006Mahendran Arumugam, Aarthi Chandramohan +1 more
New competitive approaches to particle swarm optimization (PSO) algorithm in terms of the global and local best values (GLbest-PSO), standard PSO and three set of variants namely, inertia weight (IW), acceleration co-efficient (AC) and mutation operators are presented.
Soft ComputingA new particle swarm algorithm for a multi-objective mixed-model assembly line sequencing problem
39 Citations2007Alireza Rahimi-Vahed, S. M. Mirghorbani +1 more
A new multi-objective particle swarm (MOPS) is designed to search locally Pareto-optimal frontier for the problem and its mathematical formulation are described, showing that MOPS provides superior results to MOGAs.
Computational IntelligenceApplications of Rough Genetic Algorithms
27 Citations2001Pawan Lingras, Cedric Davies
The paper explains how this generalization facilitates development of new genetic operators and evaluation measures and demonstrates the usefulness of rough genetic algorithms for real‐world applications.
Lecture notes in computer scienceThinking Capability of Saplings Growing Up Algorithm
25 Citations2006Ali Karcı, Bilal Alataş
In this study thinking capability of SGA has been defined and it has been demonstrated that sapling population generated initially has diversity.
Mining Fuzzy Weighted Association Rules
24 Citations2007David L. Olson, Yanhong Li
A fuzzy data mining algorithm is proposed to discovery fuzzy association rules for weighted quantitative data that are expected to be more realistic and practical than crisp association rules.
MIC Framework: An Information-Theoretic Approach to Quantitative Association Rule Mining
18 Citations2006Yiping Ke, Jack C.P. Cheng +1 more
This work proposes a framework, called MIC, which adopts an information-theoretic approach to address the problem of quantitative association rule mining and is able to obtain most of the high-confidence rules and the missing rules are shown to be less interesting.
Lecture notes in computer scienceRough Genetic Algorithms
11 Citations1999Pawan Lingras, Cedric Davies
This paper proposes rough genetic algorithms based on the notion of rough values and describes how this generalization facilitates development of new genetic operators and evaluation measures.