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

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 tha...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Applied intelligence (Dordrecht, Netherlands) Ročník 35; číslo 1; s. 110 - 122
Hlavní autoři: Özyer, Tansel, Zhang, Ming, Alhajj, Reda
Médium: Journal Article
Jazyk:angličtina
Vydáno: Boston Springer US 01.08.2011
Springer Nature B.V
Témata:
Artificial Intelligence
Clustering
Computation
Computer Science
Decision making
Genetic algorithms
Intelligence
Machines
Manufacturing
Mechanical Engineering
Objectives
Optimization
Pareto optimum
Partitioning
Processes
Tasks
Skyline computation
Multi-objective clustering
Cluster validation
Genetic algorithm
ISSN:0924-669X, 1573-7497
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0924-669X
1573-7497
DOI:10.1007/s10489-009-0206-7