Combination of genetic network programming and knapsack problem to support record clustering on distributed databases

Created by W.Langdon from gp-bibliography.bib Revision:1.8110

@Article{DBLP:journals/eswa/WedashwaraMOK16,

• author = "Wirarama Wedashwara and Shingo Mabu and Masanao Obayashi and Takashi Kuremoto",
• title = "Combination of genetic network programming and knapsack problem to support record clustering on distributed databases",
• journal = "Expert Systems with Applications",
• volume = "46",
• pages = "15--23",
• year = "2016",
• month = "15 " # mar,
• keywords = "genetic algorithms, genetic programming, Genetic network programming, Database clustering, Knapsack problem, Record clustering",
• ISSN = "0957-4174",
• URL = "https://doi.org/10.1016/j.eswa.2015.10.006",
• DOI = "doi:10.1016/j.eswa.2015.10.006",
• timestamp = "Fri, 26 May 2017 01:00:00 +0200",
• biburl = "https://dblp.org/rec/journals/eswa/WedashwaraMOK16.bib",
• bibsource = "dblp computer science bibliography, https://dblp.org",
• size = "15 pages",
• abstract = "This research involves implementation of genetic network programming (GNP) and standard dynamic programming to solve the knapsack problem (KP) as a decision support system for record clustering in distributed databases. Fragment allocation with storage capacity limitation problem is a background of the proposed method. The problem of storage capacity is to distribute sets of fragments into several sites (clusters). Total amount of fragments in each site must not exceed the capacity of site, while the distribution process must keep the relation (similarity) between fragments within each site. The objective is to distribute big data to certain sites with the limited amount of capacities by considering the similarity of distributed data in each site. To solve this problem, GNP is used to extract rules from big data by considering characteristics (value ranges) of each attribute in a dataset. The proposed method also provides partial random rule extraction method in GNP to discover frequent patterns in a database for improving the clustering algorithm, especially for large data problems. The concept of KP is applied to the storage capacity problem and standard dynamic programming is used to distribute rules to each site by considering similarity (value) and data amount (weight) related to each rule to match the site capacities. From the simulation results, it is clarified that the proposed method shows some advantages over the conventional clustering algorithms, therefore, the proposed method provides a new clustering method with an additional storage capacity problem.",
• notes = "Graduate School of Science and Engineering, Yamaguchi University, Tokiwadai 2-16-1, Ube, Yamaguchi 755-8611, Japan",

}

Genetic Programming entries for Wirarama Wedashwara Shingo Mabu Masanao Obayashi Takashi Kuremoto

Citations