• #0 (no title)
  • #0 (no title)
  • About
  • Facebook
  • Twitter
  • RSS
(As ISO 9001:2015 Certified Publications)
    • Quick Search
    • Advanced Search
  • Home
  • Editorial Policy
  • Author Guidelines
  • Submission
  • Copyright Form
  • Career
  • Contact us
  • Subscription

Back to Journal

Home»Articles»Multi-Objective Optimization to Identify High Quality Clusters with Close Referential Point using Evolutionary Clustering Techniques

JournalCover

Asian Journal of Computer Science and Technology (AJCST)

Editor Dr. K. Ganesh
Print ISSN : 2249-0701
Frequency : Quarterly

Multi-Objective Optimization to Identify High Quality Clusters with Close Referential Point using Evolutionary Clustering Techniques

Author : M. Anusha
Volume 7 No.3 October-December 2018 pp 68-71

Abstract

Most of the real-world optimization problems have multiple objectives to deal with. Satisfying one objective at a time may lead to the huge deviation in other. This paper uses criterion knowledge ranking algorithm solving multi-objective optimization problems. The aim of this research paper is to solve a multi-objective optimization algorithm with close reference point learning method to identify high quality data clusters. A Simple crossover measure is used to quantify the diversity of the whole set, by considering all patterns as a complete entity. In this paper, the task of identifying high quality data clusters using close reference points is proposed to solve multi-objective optimization problem using evolutionary clustering techniques. The proposed algorithm finds the closest feature from the selected features of the data sets that also minimizes the cost while maintains the quality of the solution by producing better convergence. The resultant clusters were analysed and validated using cluster validity indexes. The proposed algorithm is tested with several UCI real-life data sets. The experimental results substantiates that the algorithm is efficient and robust.

Keywords

Multi-Objective Optimization, Reference Point Learning, Evolutionary Clustering, Feature Selection, High Quality Data Clusters

Full Text:

References

[1] H.R.Cheshmehgaz, H.Haron, and A.Sharifi, “The review of multiple evolutionary searchs and multi-objecive evolutionary algorithm”, Artificial Intelligence, pp. 1-33, 2013.
[2] O.Schutze, M.Laumanns, C.A.C.Collo and E.G.Talbi, “Compting gap free pareto front approximations with stochastic search algorithms”, Evolu.Compt., Vol. 18,No. 1,pp. 65-96, 2010.
[3] Sk.M.Islam, S.Das, S.Ghosh, S.Roy and P.N.Suganthan, “An adaptive differential evolution algorithm with novel mutation andcrossover strategies for global numerical optimization”, IEEE. Trans. SMC., Vol. 12, No. 2, pp. 282-500, 2012.
[4] Wu, Le, Liu, Qi, Chen, Enhong, Yuan, Nicholas Jing, Guo, Guangming, Xie, Xing, “Relevance meets coverage: A unified framework to generate diversified recommendations”, ACM Trans. Intell. Syst. Technol. Vol.7, No.3, pp. 39.1-39.30, 2016
[5] Yin, Junfu, Zheng, Zhigang, Cao, Longbing, Song, Yin, Wei, Wei, “Efficiently mining top-k high utility sequential patterns”, In: IEEE International Conference on DataMining, pp. 1259–1264. 2013.
[6] Zihayat, Morteza, An, Aijun, “Mining top-k high utility patterns over data streams”,Inf. Sci, Vol.285,No.20,pp.138–161, 2014.
[7] Ryang, Heungmo, Yun, Unil, “Top-k high utility pattern mining with effective threshold raising strategies” Knowl.-Based Syst, Vol.76, pp.109–126. 2015.
[8] Tseng, S. Vincent Wu, Chengwei, Fournierviger, Philippe, Yu, Philip S., “Efficient algorithms for mining top-k high utility itemsets”, IEEE Trans. Knowl. Data Eng, Vol. 28, No. 1, pp. 54–67. 2016.
[9] Hammar, Mikael, Karlsson, Robin, Nilsson, Bengt J., “Using maximum coverage to optimize recommendation systems in e-commerce.”, Proceedings of the 7th ACM Conference on Recommender Systems, pp. 265–272, 2013.
[10] Lucas, Tarcsio, Silva, Tlio C. P.B., Vimieiro, Renato, Ludermir, Teresa B., “A new evolutionary algorithm for mining top-k discriminative patterns in high dimensional data.” Appl. Soft Comput, Vol. 59, pp. 487-499. 2017.
[11] Rui Wang, Peter J.Fleming, and Robin C. Purshouse “General framework for localised multi-objective evolutionary algorithms”, Information Sciences, Elsevier, pp. 29-53, 2014.
[12] Alvaro Gracia-Piquer, Albert Fornells, Jaume Bacardit, Albert Orriols and Elisabet Golobardes,“Large-Scale Experimental Evaluation of Cluster Representations for Multiobjective Evolutionary Clustering”, IEEE Transcations on Evolutionary Computation, pp. 36-53, 2014.
[13] Hu Xia, Jian Zhuang, Dehong Yu, “Novel soft subspace clustering with multi-objective evolutionary approach for high- dimensional data”, Pattern Recognition, Elsevier, pp.2562-2575, 2013.
[14] Sujoy Chatterjee and Anirban Mukhopadhyay, “Clustering Ensemble: A Multiobjective Genetic Algorithm based Approach”, Procedia Technology, Elsevier, pp. 443-449, 2013.
[15] Shi-Zheng Zhao, Ponnuthurai Nagaratnam Suganthan and Qingfu, “Decomposition–Based Multiobjective Evolutionary Algorithm with an Ensemble of Neighborhood Sizes”, IEEE Transactions on Evolutionary Computation, pp. 442-446, 2012.
[16] Gema Bello-Orgaz, and David Camacho, “Evolutionary clustering algorithm for community detection using graph-based information”, IEEE Cong.Evolu.Compt., pp. 930-937. 2014.
[17] Hemant Kumar Singh, Amitay Isaacs,and Tapabrata Ray, “A pareto corner search evolutionary algorithm and dimensionality reduction in
many-objective optimization problem”, IEEE Trans.Evolu.Compt., Vol. 15, No. 4, pp. 539-556, 2011.
[18] M.Anusha and J.G.R.Sathiaseelan, “An Improved K-Means Genetic Algorithm for Multi-objective Optimization”, International Journal of Applied Engineering Research,pp. 228-231, 2015.
[19] M.Anusha and J.G.R.Sathiaseelan, “An Empirical Study on Multi-Objective Genetic Algorithms using Clustering Techniques”, International Journal of Advanced Intelligence Paradigms. Vol. 8, No. 3, pp. 343-354, UK, 2016.
[20] M.Anusha and J.G.R .Sathiaseelan, “Feature Selection using K-Means Genetic Algorithm for Multi-objective Optimization”, Procedia Computer Science, Vol. 57, pp. 1074-1080. Elsevier B.V., Netherland, 2015
[21] M.Anusha and J.G.R.Sathiaseelan, “An Enhanced K-means Genetic Algorithms for Optimal Clustering”, IEEE International Conference on Computational Intelligence and Computing Research (ICCIC), pp.580-584, 2014.
[22] Zihayat, Morteza, and Aijun, “Mining top-k high utility patterns over data streams”, Inf. Sci.Vol. 285, No.20, pp. 138–161, 2014.
[23] Ryang, Heungmo, Yun, Unil, “Top-k high utility pattern mining with effective threshold raising strategies”, Knowl.-Based Syst. Vol.76, pp.109–126. 2015.
[24] Yang, Yi, Yan, Da, Wu, Huanhuan, Cheng, James, Zhou, Shuigeng, Lui, JohnC.S., “Diversified temporal subgraph pattern mining”, Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1965–1974. 2016.
[25] Tseng, Vincent S., Wu, Cheng-Wei, Shie, Bai-En, Yu, Philip S., “UP-growth: an efficient algorithm for high utility item set mining”, Proceedings of ACM SIGKDD Conference on Knowledge Discovery and Data Mining. ACM, pp. 253–262, 2010.
[26] Kannimuthu, S., Premalatha, K., “Discovery of high utility itemsets using genetic algorithm with ranked mutation” Appl. Artif. Intell, Vol. 28, No.4, pp. 337–359, 2014.
[27] Lin, Jerry Chun-Wei, Yang, Lu, Fournier-Viger, Philippe, Hong, Tzung-Pei, Voznak, Miroslav, “A binary PSO approach to mine high-utility itemsets”, Soft Comput. Vol. 21, pp. 5103–5121. 2017.
[28] Wu, Jimmy Mingtai, Zhan, Justin, Lin, Jerry Chunwei, “An ACO-based approach to mine high-utility itemsets”, Knowl.-Based Syst, 2017. Vol.116, pp.102–113. 2017.
[29] M.Anusha and J.G.R. Sathiaseelan, “Evolutionary Clustering Algorithm using Criterion-Knowledge-Ranking for Multi-objective Optimization”, Wireless Personal Communication, Springer, Vol.94, pp.2009-2030, Springer, USA. 2017
[30] M.Anusha and J.G.R. Sathiaseelan, “An Improved K-Means Genetic Algorithm for Multi-objective Optimization”, International Journal of Applied Engineering Research, pp. 228-231, 2015.

Asian Journal of Computer Science and Technology is a peer-reviewed international journal that publishes high-quality scientific articles (both theory and practice) and research papers covering all aspects of future computer and Information Technology areas. Topics include, but are not limited to:

Foundations of High-performance ComputingTheory of algorithms and computability

Parallel & distributed computing

Computer networks

Neural networks

LAN/WAN/MAN

Database theory & practice

Mobile Computing for e-Commerce

Future Internet architecture

Protocols and services

Mobile and ubiquitous networks

Green networking

Internet content search

Opportunistic networking

Network applications

Network scaling and limits

Artifial Intelligences

Pattern/Image Recognitions

Communication Network

Information Security

Knowledge Management

Management Information systems

Multimedia communicatiions

Operations research

Optical networks

Software Engineering

Virtual reality

Web Technologies

Wireless technology

Most of the real-world optimization problems have multiple objectives to deal with. Satisfying one objective at a time may lead to the huge deviation in other. This paper uses criterion knowledge ranking algorithm solving multi-objective optimization problems. The aim of this research paper is to solve a multi-objective optimization algorithm with close reference point learning method to identify high quality data clusters. A Simple crossover measure is used to quantify the diversity of the whole set, by considering all patterns as a complete entity. In this paper, the task of identifying high quality data clusters using close reference points is proposed to solve multi-objective optimization problem using evolutionary clustering techniques. The proposed algorithm finds the closest feature from the selected features of the data sets that also minimizes the cost while maintains the quality of the solution by producing better convergence. The resultant clusters were analysed and validated using cluster validity indexes. The proposed algorithm is tested with several UCI real-life data sets. The experimental results substantiates that the algorithm is efficient and robust.

Editor-in-Chief
Dr. K. Ganesh
Global Lead, Supply Chain Management, Center of Competence and Senior Knowledge
Expert at McKinsey and Company, India
[email protected]
Editorial Advisory Board
Dr. Eng. Hamid Ali Abed AL-Asadi
Department of Computer Science, Basra University, Iraq
[email protected]
Dr. Norjihan Binti Abdul Ghani
Department of Information System, University of Malaya, Malaysia
[email protected]
Dr. Christos Bouras
Department of Computer Engineering & Informatics, University of Patras, Greece
[email protected]
Dr. Maizatul Akmar Binti Ismail
Department of Information System, University of Malaya, Malaysia
[email protected]
Dr. Harold Castro
Department of Systems Engineering and Computing, University of the Andes, Colombia
[email protected]
Dr. Busyairah Binti Syd Ali
Department of Software Engineering, University of Malaya, Malaysia
[email protected]
Dr. Sri Devi Ravana
Department of Information system, University of Malaya, Malaysia
[email protected]
Dr. Karpaga Selvi Subramanian
Department of Computer Engineering, Mekelle University, Ethiopia
[email protected]
Dr. Mazliza Binti Othman
Department of Computer System & Technology, University of Malaya, Malaysia
[email protected]
Dr. Chiam Yin Kia
Department of Software Engineering, University of Malaya, Malaysia
[email protected]
Dr. OUH Eng Lieh
Department of Information Systems, Singapore Management University, Singapore
[email protected]

2016

2015

2014

  • Results
  • Asian Review of Mechanical Engineering (ARME)
  • career

2013

  • Home
  • Shop
  • My Account
  • Logout
  • Contact us
  • The Asian Review of Civil Engineering (TARCE)

2012

  • Asian Journal of Electrical Sciences(AJES)
  • Asian Journal of Computer Science and Technology (AJCST)
  • Asian Journal of Information Science and Technology (AJIST)
  • Asian Journal of Engineering and Applied Technology (AJEAT)
  • Asian Journal of Science and Applied Technology (AJSAT)
  • Asian Journal of Managerial Science (AJMS)
  • Asian Review of Social Sciences (ARSS)

2011

2010

    Table of Contents

    Editorial Note

    Editorial Dr. K. Ganesh

    Editor-in-Chief
    Dr. K. Ganesh
    Global Lead, Supply Chain Management, Center of Competence and Senior Knowledge
    Expert at McKinsey and Company, India
    [email protected]
    Editorial Advisory Board
    Dr. Eng. Hamid Ali Abed AL-Asadi
    Department of Computer Science, Basra University, Iraq
    [email protected]
    Dr. Norjihan Binti Abdul Ghani
    Department of Information System, University of Malaya, Malaysia
    [email protected]
    Dr. Christos Bouras
    Department of Computer Engineering & Informatics, University of Patras, Greece
    [email protected]
    Dr. Maizatul Akmar Binti Ismail
    Department of Information System, University of Malaya, Malaysia
    [email protected]
    Dr. Harold Castro
    Department of Systems Engineering and Computing, University of the Andes, Colombia
    [email protected]
    Dr. Busyairah Binti Syd Ali
    Department of Software Engineering, University of Malaya, Malaysia
    [email protected]
    Dr. Sri Devi Ravana
    Department of Information system, University of Malaya, Malaysia
    [email protected]
    Dr. Karpaga Selvi Subramanian
    Department of Computer Engineering, Mekelle University, Ethiopia
    [email protected]
    Dr. Mazliza Binti Othman
    Department of Computer System & Technology, University of Malaya, Malaysia
    [email protected]
    Dr. Chiam Yin Kia
    Department of Software Engineering, University of Malaya, Malaysia
    [email protected]
    Dr. OUH Eng Lieh
    Department of Information Systems, Singapore Management University, Singapore
    [email protected]

    Articles

Advanced Search

You can submit your research paper to the journal in just a few clicks. Please follow the steps outlined below: 1. Register your details and select to be an Author 2. Log in with your user name and password 3. ‘Start a new submission’ and follow these 5 steps:

[gravityform id="1" name="Registration" title="false" description="false"]

Privacy Statement

The names and email addresses entered in this journal site will be used exclusively for the stated purposes of this journal and will not be made available for any other purpose or to any other party.

Privacy Statement

The names and email addresses entered in this journal site will be used exclusively for the stated purposes of this journal and will not be made available for any other purpose or to any other party.

Lorem1 ipsum dolor sit amet, consectetur adipiscing elit. Nulla convallis ultricies scelerisque. Fusce dolor augue, sollicitudin eget lacus vitae, rutrum commodo lacus. Praesent ullamcorper facilisis dui. Sed suscipit id lorem ut dapibus. Integer dictum cursus nisl, quis ullamcorper augue. Sed non rutrum mauris. Maecenas in dolor est. Donec eget sagittis mi. Sed non leo eu odio mollis pulvinar vitae et leo. Integer eu feugiat tortor. Duis massa purus, eleifend id erat eget, hendrerit semper risus. Suspendisse cursus varius dapibus

Lorem1 ipsum dolor sit amet, consectetur adipiscing elit. Nulla convallis ultricies scelerisque. Fusce dolor augue, sollicitudin eget lacus vitae, rutrum commodo lacus. Praesent ullamcorper facilisis dui. Sed suscipit id lorem ut dapibus. Integer dictum cursus nisl, quis ullamcorper augue.

Subscription

Subscription (for 12 issues):
Rs. 5000; Overseas - USD 500;
Cheque drawn in favour of "Informatics Publishing Limited"
Click here to download online subscription form

Download

DD Mailing Address

Lorem1 ipsum dolor sit amet,
Lorem1 ipsum dolor sit amet,
Lorem1 ipsum dolor sit amet.

BACK TO TOP

Outstanding Scholars

The Journals honor Outstanding Scholars in various fields. Scholar of the Month should have contributed to their field and to the larger community. Recipients will be nominated by the Advisory Board and approved by the Editor-in-Chief of the allied journals published by The Research Publication. Scholar of the Month will be displayed in the web portal of the concerned journal.

Please send your brief write up to [email protected]

Editors and Reviewers

The Research Publication is seeking qualified researchers to join its editorial team as Associate Editor, Editorial Advisory Board Member, and Reviewers.
Kindly send your details to [email protected]

Call For Papers

Authors are requested to submit their papers electronically to [email protected] with mentioning the journal title.

Mailing Address

The Research Publication 1/611, Maruthi Nagar, Rakkipalayam Post, Coimbatore – 641 031, Tamil Nadu, India Phone No.: 0422 2461001

  • About
  • Editorial Policy
  • Author Guidelines
  • Contact us
  • Copyright
  • Facebook
  • Twitter
  • RSS

© 2015 The Research Publication. All rights reserved.

The Research Publication
  • Home
  • Editorial Policy
  • Author Guidelines
  • Submission
  • Copyright Form
  • Career
  • Contact us
  • Subscription