| 000 -LEADER |
|---|
| fixed length control field |
02766nam a22002417a 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
ft8894 |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20251218104245.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
251218b ||||| |||| 00| 0 eng d |
| 041 ## - LANGUAGE CODE |
|---|
| Language code of text/sound track or separate title |
engtag |
| 050 ## - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA76.9 A43 P66 2025 |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
. |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Ponce, Lemuel A.; Satuito, Janine Beatriz M.; Tesoro, Russelliza B. |
| 245 ## - TITLE STATEMENT |
|---|
| Title |
Enhancement of birch algorithm by celiz and mayo applied in customer segmentation |
| 264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE |
|---|
| Place of production, publication, distribution, manufacture |
. |
| Name of producer, publisher, distributor, manufacturer |
. |
| Date of production, publication, distribution, manufacture, or copyright notice |
c2025 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Other physical details |
Undergraduate Thesis: (Bachelor of Science in Computer Science) - Pamantasan ng Lungsod ng Maynila, 2025 |
| 336 ## - CONTENT TYPE |
|---|
| Source |
text |
| Content type term |
text |
| Content type code |
text |
| 337 ## - MEDIA TYPE |
|---|
| Source |
unmediated |
| Media type term |
unmediated |
| Media type code |
unmediated |
| 338 ## - CARRIER TYPE |
|---|
| Source |
volume |
| Carrier type term |
volume |
| Carrier type code |
volume |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
ABSTRACT: The BIRCH algorithm is known for being able to cluster large datasets. However, the some algorithms, it also faces challenges. First, the algorithm still struggles to cluster irregular shaped data effectively, resulting in imprecise clustering results for non-spherical data. Secondly, noise is still present in the existing BIRCH, leading to reduced clustering accuracy and distorted cluster boundaries. Hence, it effects its performance. Lastly, existing BIRCH relies heavily on Traditional Distance Metrics, resulting in handling inadequate categorical components which yields to suboptimal clustering outcomes. The proposed method to address the algorithm’s challenges in handling irregular shaped data is to apply the whole iteration phase of the clustering algorithm to capture irregular data within a dataset. To resolve the algorithm’s struggle in noise, the proposed technique is the implementation of the Local Outlier Factor in the algorithm’s process for the purpose of the identification and noise reduction to further improve its clustering accuracy. Finally, for better handling of categorial data, the proposed technique is the application of the Gower Distance Metric for the clustering of mixed-type data to optimize clustering performance for both numerical and categorical data. The result of applying the whole iteration phase showed that the enhanced BIRCH gained a higher Silhouette Score than the existing BIRCH algorithm. While the result of the implementation of the Local Outlier Factor showed that most of the datasets obtained a higher Adjusted Rand Index than the existing algorithm. Lastly, the result of incorporating Gower Distance Metric into the algorithm showed good Manual Information results, most datasets gathered higher MI results than the existing algorithm. Overall, the challenges and struggles in the existing algorithm have been successfully addressed and the enhanced BIRCH showed better performance and yielded good results |
| 526 ## - STUDY PROGRAM INFORMATION NOTE |
|---|
| Classification |
Filipiniana |
| 655 ## - INDEX TERM--GENRE/FORM |
|---|
| Genre/form data or focus term |
academic writing |
| 942 ## - ADDED ENTRY ELEMENTS |
|---|
| Source of classification or shelving scheme |
|
| Item type |
Thesis/Dissertation |