MARC details
| 000 -LEADER |
|---|
| fixed length control field |
04326ntm a2200373 i 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
MY-KuUP |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20251125105817.0 |
| 006 - FIXED-LENGTH DATA ELEMENTS--ADDITIONAL MATERIAL CHARACTERISTICS |
|---|
| fixed length control field |
t||||fr|||| 000 0 |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION |
|---|
| fixed length control field |
ta |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
201118t2 2 m a|||fram|| 000 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
THE0008990(Local) |
| Qualifying information |
hardback |
| 040 ## - CATALOGING SOURCE |
|---|
| Language of cataloging |
eng |
| Transcribing agency |
UMP |
| Description conventions |
rda |
| 090 ## - LOCALLY ASSIGNED LC-TYPE CALL NUMBER (OCLC); LOCAL CALL NUMBER (RLIN) |
|---|
| Classification number (OCLC) (R) ; Classification number, CALL (RLIN) (NR) |
FKOM .H36 2020 r Thesis |
| 100 0# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Haneen Abdul Wahab Abdul Raheem, |
| Relator term |
author. |
| 245 12 - TITLE STATEMENT |
|---|
| Title |
A new variant of black hole algorithm based on multi population and levy flight for clustering problem / |
| Statement of responsibility, etc. |
Haneen Abdul Wahab Abdul Raheem |
| 264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE |
|---|
| Place of production, publication, distribution, manufacture |
Kuantan, Pahang : |
| Name of producer, publisher, distributor, manufacturer |
UMP, |
| Date of production, publication, distribution, manufacture, or copyright notice |
2020 |
| 264 #4 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE |
|---|
| Date of production, publication, distribution, manufacture, or copyright notice |
© 2020 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xiii, 156 pages : |
| Other physical details |
illustrations (some color) ; |
| Dimensions |
30 cm. + |
| Accompanying material |
1 CD-ROM |
| 336 ## - CONTENT TYPE |
|---|
| Content type term |
text |
| Source |
rdacontent |
| 336 ## - CONTENT TYPE |
|---|
| Content type term |
text |
| Source |
rdacontent |
| 337 ## - MEDIA TYPE |
|---|
| Media type term |
unmediated |
| Source |
rdamedia |
| 337 ## - MEDIA TYPE |
|---|
| Media type term |
computer |
| Source |
rdamedia |
| 338 ## - CARRIER TYPE |
|---|
| Carrier type term |
volume |
| Source |
rdacarrier |
| 338 ## - CARRIER TYPE |
|---|
| Carrier type term |
computer disc |
| Source |
rdacarrier |
| 347 ## - DIGITAL FILE CHARACTERISTICS |
|---|
| File type |
text file |
| Encoding format |
PDF |
| Source |
rda |
| 500 ## - GENERAL NOTE |
|---|
| General note |
Faculty of Computing |
| 502 ## - DISSERTATION NOTE |
|---|
| Dissertation note |
Thesis (Doctor of Philosophy) -- Universiti Malaysia Pahang – 2020 |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc. note |
Includes bibliographical references |
| 520 3# - SUMMARY, ETC. |
|---|
| Summary, etc. |
Data clustering is one of the most popular branches in machine learning and data analysis. Partitioning-based type of clustering algorithms, such as K-means, is prone to the problem of producing a set of clusters that is far from perfect due to its probabilistic nature. The clustering process starts with some random partitions at the beginning, and it tries to improve the partitions progressively. Different initial partitions can result in different final clusters. Trying through all the possible candidate clusters for the perfect result is too time consuming. Metaheuristic algorithm aims to search for global optimum in high dimensional problems. Meta-heuristic algorithm has been successfully implemented on data clustering problems seeking a near optimal solution in terms of quality of the resultant clusters. Recently, nature-inspired algorithms have been proposed and utilized for solving the optimization problems in general, and data clustering problem in particular. Black Hole (BH) optimization algorithm has been underlined as a solution for data clustering problems. The BH is a population-based metaheuristic that emulates the phenomenon of the BH in the universe. In this instance, every solution in motion within the search space represents an individual star. The original BH has shown a superior performance when applied on a benchmark dataset; however, it lacks exploration capabilities. In keeping with this limitation, this study proposes a new variant of BH through two different modifications on the original BH. The first modification is the integration of BH algorithm and levy flight, which result in data clustering method, namely “Levy Flight Black Hole (LBH)”. In LBH, the movement of each star mainly depends on the step size generated by the Levy distribution. Therefore, the star explores a far area from the current BH when the value step size is big, and vice versa. The second modification is the multiple population BH that is proposed as a generalization to the BH algorithm, in which the algorithm was not reliant upon the best solution but rather on a set of best solutions generated, called “MBH”. As a result, a new variant of BH for high dimensional datasets which is called multiple population levy black hole (MLBH) has been proposed for handling normal and high dimensional datasets through the integration of LBH and MBH. The obtained results were compared with the BH and previous optimization algorithms for both test functions as well as data clustering in terms of normal and high dimensional datasets. Overall, the experimental outcomes and analysis of the obtained results indicated that the proposed algorithms have satisfied most of the required criteria. Furthermore, the results revealed a high convergence rate, upon which the algorithm’s performance was subjected to data clustering problems and investigated using six real datasets. The datasets were retrieved from the UCI machine-learning laboratory. The future research directions are also discussed in the study. |
| 610 20 - SUBJECT ADDED ENTRY--CORPORATE NAME |
|---|
| Corporate name or jurisdiction name as entry element |
Faculty of Computing |
| General subdivision |
Dissertations |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Universities and colleges |
| General subdivision |
Dissertations |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Theses |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
Library of Congress Classification |
| Koha item type |
Thesis |