Integrating multi-objective genetic algorithm based clustering and data partitioning for skyline computation

Authors:
Tansel Özyer;Ming Zhang;Reda Alhajj
Affiliations:
Department of Computer Engineering, TOBB ETU Economics and Technology University, Ankara, Turkey 06560;Department of Computer Science, University of Calgary, Calgary, Canada;Department of Computer Science, University of Calgary, Calgary, Canada and Department of Computer Science, Global University, Beirut, Lebanon
Venue:
Applied Intelligence
Year:
2011

Citing 33
Cited 6

Computing dominances inEn (short communication)

Information Processing Letters
Multi-objective genetic algorithm and its applications to flowshop scheduling

Computers and Industrial Engineering
Distance browsing in spatial databases

ACM Transactions on Database Systems (TODS)
On Finding the Maxima of a Set of Vectors

Journal of the ACM (JACM)
The Skyline Operator

Proceedings of the 17th International Conference on Data Engineering
A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II

PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
Efficient Progressive Skyline Computation

Proceedings of the 27th International Conference on Very Large Data Bases
FGKA: a Fast Genetic K-means Clustering Algorithm

Proceedings of the 2004 ACM symposium on Applied computing
An Application of a Multi-Objective Tabu Search Algorithm to a Bicriteria Flowshop Problem

Journal of Heuristics
Progressive skyline computation in database systems

ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Stratified computation of skylines with partially-ordered domains

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Efficient computation of the skyline cube

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Catching the best views of skyline: a semantic approach based on decisive subspaces

VLDB '05 Proceedings of the 31st international conference on Very large data bases
A compact space decomposition for effective metric indexing

Pattern Recognition Letters
Maintaining Sliding Window Skylines on Data Streams

IEEE Transactions on Knowledge and Data Engineering
Robust Cardinality and Cost Estimation for Skyline Operator

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
SUBSKY: Efficient Computation of Skylines in Subspaces

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Refreshing the sky: the compressed skycube with efficient support for frequent updates

Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Finding k-dominant skylines in high dimensional space

Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Continuous Skyline Queries for Moving Objects

IEEE Transactions on Knowledge and Data Engineering
Shooting stars in the sky: an online algorithm for skyline queries

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficient skyline computation over low-cardinality domains

VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Approaching the skyline in Z order

VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Angle-based space partitioning for efficient parallel skyline computation

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Efficient skyline querying with variable user preferences on nominal attributes

Proceedings of the VLDB Endowment
Multi-objective genetic algorithms based automated clustering for fuzzy association rules mining

Journal of Intelligent Information Systems
Skyline Query Processing for Incomplete Data

ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Parallel clustering of high dimensional data by integrating multi-objective genetic algorithm with divide and conquer

Applied Intelligence
Multicriteria network design using evolutionary algorithm

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
On set-based multiobjective optimization

IEEE Transactions on Evolutionary Computation
Recursive lists of clusters: a dynamic data structure for range queries in metric spaces

ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Clustering by integrating multi-objective optimization with weighted k-means and validity analysis

IDEAL'06 Proceedings of the 7th international conference on Intelligent Data Engineering and Automated Learning
Multiobjective optimization and multiple constraint handling with evolutionary algorithms. I. A unified formulation

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

A two-leveled symbiotic evolutionary algorithm for clustering problems

Applied Intelligence
Solving Japanese nonograms by Taguchi-based genetic algorithm

Applied Intelligence
Dynamic clustering using combinatorial particle swarm optimization

Applied Intelligence
Dynamic group-based differential evolution using a self-adaptive strategy for global optimization problems

Applied Intelligence
Reporting and analyzing alternative clustering solutions by employing multi-objective genetic algorithm and conducting experiments on cancer data

Knowledge-Based Systems
Cell assignment in hybrid CMOS/nanodevices architecture using Tabu Search

Applied Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Skyline computation in databases has been a hot topic in the literature because of its interesting applications. The basic idea is to find non-dominated values within a database. The task is mainly a multi-objective optimization process as described in this paper. This motivated for our approach that employs a multi-objective genetic algorithm based clustering approach to find the pareto-optimal front which allows us to locate skylines within a given data. To tackle large data, we simply split the data into manageable subsets and concentrate our analysis on the subsets instead of the whole data at once. The proposed approach produced interesting results as demonstrated by the outcome from the conducted experiments.