Monothetic clustering algorithms based on measures of association / (Record no. 2514)

MARC details
000 -LEADER
fixed length control field 02962nam a22002893a 4500
001 - CONTROL NUMBER
control field UPMIN-00005135667
003 - CONTROL NUMBER IDENTIFIER
control field UPMIN
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20221205145426.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 221205b |||||||| |||| 00| 0 eng d
040 ## - CATALOGING SOURCE
Original cataloging agency DLC
Transcribing agency UPMin
Modifying agency upmin
041 ## - LANGUAGE CODE
Language code of text/sound track or separate title eng
090 #0 - LOCALLY ASSIGNED LC-TYPE CALL NUMBER (OCLC); LOCAL CALL NUMBER (RLIN)
Classification number (OCLC) (R) ; Classification number, CALL (RLIN) (NR) LG993.5 2010 A64
Local cutter number (OCLC) ; Book number/undivided call number, CALL (RLIN) C66
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Comendador, Christine Y.
9 (RLIN) 363
245 ## - TITLE STATEMENT
Title Monothetic clustering algorithms based on measures of association /
Statement of responsibility, etc. Christine Y. Comendador
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Date of publication, distribution, etc. 2010
300 ## - PHYSICAL DESCRIPTION
Extent 111 leaves
500 ## - GENERAL NOTE
General note Thesis, Undergraduate (BS in Applied Mathematics - Operations Research) -- U.P. Mindanao
520 3# - SUMMARY, ETC.
Summary, etc. Cluster analysis is one common technique that is used in multivariate analysis. Its objective is to maximize the dissimilarity of objects within the sane cluster and maximize the dissimilarity of object among different clusters. Monothetic analysis is a class of methods used for clustering binary data. Monothetic analysis algorithms produce a hierarchy of clusters in which each step a group is split into two clusters based on the values of one of the binary variables. However, existing monothetic algorithms use the simplest association measure. This study was done to test whether Yule?s q, Yule's y, Phi coefficient and percent difference could be used as a splitting criterion. The algorithm was modified in such a way that variables having identical values for all observations were ignored to avoid undefined values for the association between variables and by replacing the standard criterion with the selected association measures. The modified algorithms were tested with twenty simulated binary data resulted in identifying the same number of cluster. Nevertheless, the algorithms varied in the selection of splitting variable and in effect, results to different number of iterations performed. Yule?s y ? based MONA performs the fastest algorithm among the modified algorithms and Phi coefficient ? based MONA performs the slowest algorithm in terms of the number of iterations. However, percentage difference ?based MONA yields the fastest algorithm compared to all other algorithms in terms of processing time. Aside from the simulated data sets, an application to the habitat of 16 species to 129 communities was also used in this study. As a result, it confirms the fact that Percent difference ?based MONA performs the fastest algorithm compared to all algorithms in terms of processing time. Also, it confirms the fact that Phi coefficient ?based MONA performs slowest algorithm. Despite the fact that Percent difference ?based MONA is the fastest algorithm on both application to data sets, further study are still needed to verify the performance of these modified algorithms
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Association measures
9 (RLIN) 364
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Binary data
9 (RLIN) 365
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Clustering
9 (RLIN) 366
650 17 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Monothetic analysis
9 (RLIN) 367
658 ## - INDEX TERM--CURRICULUM OBJECTIVE
Main curriculum objective Undergraduate Thesis
Curriculum code AMAT200
905 ## - LOCAL DATA ELEMENT E, LDE (RLIN)
a Fi
905 ## - LOCAL DATA ELEMENT E, LDE (RLIN)
a UP
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Library of Congress Classification
Koha item type Thesis
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Status Collection Home library Current library Shelving location Date acquired Source of acquisition Accession Number Total Checkouts Full call number Barcode Date last seen Koha item type
    Library of Congress Classification   Not For Loan Preservation Copy University Library University Library Archives and Records 2013-11-06 donation UAR-T-gd1817   LG993.5 2010 A64 C66 3UPML00033193 2022-10-05 Thesis
    Library of Congress Classification   Not For Loan Preservation Copy College of Science and Mathematics University Library Theses 2010-10-05 donation CSM-T-gd2704   LG993.5 2010 A64 C66 3UPML00012657 2022-10-05 Thesis
 
University of the Philippines Mindanao
The University Library, UP Mindanao, Mintal, Tugbok District, Davao City, Philippines
Email: library.upmindanao@up.edu.ph
Contact: (082)295-7025
Copyright @ 2022 | All Rights Reserved