| 000 | 05749nam a2201225Ia 4500 | ||
|---|---|---|---|
| 000 | 03579ntm a2200205 i 4500 | ||
| 001 | 74394 | ||
| 003 | 0 | ||
| 005 | 20250920173724.0 | ||
| 008 | 181003n 000 0 eng d | ||
| 010 |
_z _z _o _a _b |
||
| 015 |
_22 _a |
||
| 016 |
_2 _2 _a _z |
||
| 020 |
_e _e _a _b _z _c _q _x |
||
| 022 |
_y _y _l _a2 |
||
| 024 |
_2 _2 _d _c _a _q |
||
| 028 |
_a _a _b |
||
| 029 |
_a _a _b |
||
| 032 |
_a _a _b |
||
| 035 |
_a _a _b _z _c _q |
||
| 037 |
_n _n _c _a _b |
||
| 040 |
_e _erda _a _d _b _c |
||
| 041 |
_e _e _a _b _g _h _r |
||
| 043 |
_a _a _b |
||
| 045 |
_b _b _a |
||
| 050 |
_a _a _d _b2 _c0 |
||
| 051 |
_c _c _a _b |
||
| 055 |
_a _a _b |
||
| 060 |
_a _a _b |
||
| 070 |
_a _a _b |
||
| 072 |
_2 _2 _d _a _x |
||
| 082 |
_a _a _d _b2 _c |
||
| 084 |
_2 _2 _a |
||
| 086 |
_2 _2 _a |
||
| 090 |
_a _a _m _b _q |
||
| 092 |
_f _f _a _b |
||
| 096 |
_a _a _b |
||
| 097 |
_a _a _b |
||
| 100 |
_e _e _aFrancis Earl S. Fojas andAna Mikaela A. Vilar. _d _b4 _u _c0 _q16 |
||
| 110 |
_e _e _a _d _b _n _c _k |
||
| 111 |
_a _a _d _b _n _c |
||
| 130 |
_s _s _a _p _f _l _k |
||
| 210 |
_a _a _b |
||
| 222 |
_a _a _b |
||
| 240 |
_s _s _a _m _g _n _f _l _o _p _k |
||
| 245 | 0 |
_a _aA further enhancement of K-Medoid clustering algorithm applied on blood donor behavior segmentation / _d _b _n _cFrancis Earl S. Fojas and Ana Mikaela A. Vilar. _h6 _p |
|
| 246 |
_a _a _b _n _i _f6 _p |
||
| 249 |
_i _i _a |
||
| 250 |
_6 _6 _a _b |
||
| 260 |
_e _e _a _b _f _c _g |
||
| 264 |
_3 _3 _a _d _b _c201846 |
||
| 300 |
_e _e _c28cm. _a101 pp. _b |
||
| 310 |
_a _a _b |
||
| 321 |
_a _a _b |
||
| 336 |
_b _atext _2rdacontent |
||
| 337 |
_3 _30 _b _aunmediated _2rdamedia |
||
| 338 |
_3 _30 _b _avolume _2rdacarrier |
||
| 340 |
_2 _20 _g _n |
||
| 344 |
_2 _2 _a0 _b |
||
| 347 |
_2 _2 _a0 |
||
| 362 |
_a _a _b |
||
| 385 |
_m _m _a2 |
||
| 410 |
_t _t _b _a _v |
||
| 440 |
_p _p _a _x _v |
||
| 490 |
_a _a _x _v |
||
| 500 |
_a _aThesis: (BSCS major in Computer Science)- Pamantasan ng Lungsod ng Maynila, 2018. _d _b _c56 |
||
| 504 |
_a _a _x |
||
| 505 |
_a _a _b _t _g _r |
||
| 506 |
_a _a5 |
||
| 510 |
_a _a _x |
||
| 520 |
_b _b _c _aABSTRACT: Cluster analysis serves a significant role in unsupervised machine learning, which is the exploration for new and undiscovered intelligence. Cluster analysis or commonly known as clustering is the grouping of similar data objects in a set. As technology evolves, the number of algorithm used in clustering increased. One of these clustering algorithm is the k-medoids algorithm. K-Medoids is an algorithm under the same umbrella of k-means. Presently, the latest version of k-medoid was formulated in a book, entitled Foundation of Intelligent Systems by M. Kryszkiewicz, A. Appice, D. Slezak, H. Rybinski, A. Skowron and Z.W. Ras in June 2017. In this enhanced k-medoid clustering, the algorithm produces clustering results with higher intra-cluster similarity and lower inter-cluster similarity. However, there are still three problems are identified on this algorithm. First is that the algorithm has no method of deciding where to best assign a data point having the same distance to multiple clusters. Second, the existing algorithm is not guaranteed to provide an optimal medoid for each cluster due to this algorithm using greedy search. Lastly, the algorithm naturally clusters, without identifying potential outliers. Due to this, the proponents decided to further enhance this algorithm and apply it on an application will be very beneficial for blood donation advertisers. The researchers aim to intergrade and algorithms to the existing k-medoid in order to solve the problems stated. The proponents gathered foreign and local documents, lectures and studies in order to support and prove the problems stated, as well as to find the appropriate and best solution for each problem. For the first problem, the formula for population variance was used. For the second problem, instead of finding new medoids by computing the total cost for each clustering, the solution formulated by the researchers was to ensure that in each cluster, the data point that has the minimum average distance will be considered as the medoid. Lastly, distance-based method was used in order to determine whether a data point is an outlier. As a result, variance was effective in determining where to assign a data point, since the rightness of the cluster is being considered if the data point will be designated. For the second solution, results show that clusters have tighter data points and all medoids are always in the centremost part of each cluster. For the third and final solution, all data points whose distance to its medoid is greater than the maximum inter-cluster distance are considered outliers. Aside from being more complex than the existing k-medoid, this algorithm provides better and more effective clustering results. _u |
||
| 521 |
_a _a _b |
||
| 533 |
_e _e _a _d _b _n _c |
||
| 540 |
_c _c _a5 |
||
| 542 |
_g _g _f |
||
| 546 |
_a _a _b |
||
| 583 |
_5 _5 _k _c _a _b |
||
| 590 |
_a _a _b |
||
| 600 |
_b _b _v _t _c2 _q _a _x0 _z _d _y |
||
| 610 |
_b _b _v _t2 _x _a _k0 _p _z _d6 _y |
||
| 611 |
_a _a _d _n2 _c0 _v |
||
| 630 |
_x _x _a _d _p20 _v |
||
| 648 |
_2 _2 _a |
||
| 650 |
_x _x _a _d _b _z _y20 _v |
||
| 651 |
_x _x _a _y20 _v _z |
||
| 655 |
_0 _0 _a _y2 _z |
||
| 700 |
_i _i _t _c _b _s1 _q _f _k40 _p _d _e _a _l _n6 |
||
| 710 |
_b _b _t _c _e _f _k40 _p _d5 _l _n6 _a |
||
| 711 |
_a _a _d _b _n _t _c |
||
| 730 |
_s _s _a _d _n _p _f _l _k |
||
| 740 |
_e _e _a _d _b _n _c6 |
||
| 753 |
_c _c _a |
||
| 767 |
_t _t _w |
||
| 770 |
_t _t _w _x |
||
| 773 |
_a _a _d _g _m _t _b _v _i _p |
||
| 775 |
_t _t _w _x |
||
| 776 |
_s _s _a _d _b _z _i _t _x _h _c _w |
||
| 780 |
_x _x _a _g _t _w |
||
| 785 |
_t _t _w _a _x |
||
| 787 |
_x _x _d _g _i _t _w |
||
| 800 |
_a _a _d _l _f _t0 _q _v |
||
| 810 |
_a _a _b _f _t _q _v |
||
| 830 |
_x _x _a _p _n _l0 _v |
||
| 942 |
_a _alcc _cBK |
||
| 999 |
_c25419 _d25419 |
||