| 000 -LEADER |
| fixed length control field |
02582nam a2200277Ia 4500 |
| 001 - CONTROL NUMBER |
| control field |
76992 |
| 003 - CONTROL NUMBER IDENTIFIER |
| control field |
ft6161 |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
| control field |
20251105173938.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
| fixed length control field |
190313n 000 0 eng d |
| 040 ## - CATALOGING SOURCE |
| Description conventions |
rda |
| 041 ## - LANGUAGE CODE |
| Language code of text/sound track or separate title |
engtag |
| 050 ## - LIBRARY OF CONGRESS CALL NUMBER |
| Classification number |
QA76.75 D56 2011 |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
| Classification number |
. |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
| Personal name |
Dioquino, Rica I. |
| 245 #0 - TITLE STATEMENT |
| Title |
An Enhancement of charm algorithm applied to shopping cart system |
| 264 ## - 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 |
c2011 |
| 300 ## - PHYSICAL DESCRIPTION |
| Other physical details |
Undergraduate Thesis: (BSCS major in Computer Science) - Pamantasan ng Lungsod ng Maynila, 2011. |
| 336 ## - CONTENT TYPE |
| Content type code |
. |
| Content type term |
text |
| Source |
rdacontent |
| 337 ## - MEDIA TYPE |
| Materials specified |
0 |
| Media type code |
. |
| Media type term |
unmediated |
| Source |
rdamedia |
| 338 ## - CARRIER TYPE |
| Materials specified |
0 |
| Carrier type code |
. |
| Carrier type term |
volume |
| Source |
rdacarrier |
| 505 ## - FORMATTED CONTENTS NOTE |
| Formatted contents note |
ABSTRACT: Recent years, man started to study extracting patterns from data. And as year pass; Data mining is one of the most common fields of study. Data mining is branch of computer science. It is a process of extracting patterns from a large datasets by combining methods statistics, artificial intelligence with database management. Charm algorithm is an efficient algorithm for closed association rule mining. Although the algorithm is efficient enough, some flaws are found by one proponent and these are the following: 1. The existing algorithm scanned frequently the database to be able to count the frequent support of each items. In this process there are rereading of items resulting of redundant scanning in database. 2. In the existing algorithm, the minimal support is set to 50%. If the user chose an item and it doesn’t reach the qualified minimal support, there will be no output to be produced. And since the item being tested doesn’t reach the minimal support, that item will not undergo the algorithm process that computes for the closed item set which refers to association of one item to another item. Even the user chose item that reach the minimum support of 50, the items with less than the minimum support will also be eliminated as initial node in searching process. This problem has been highlighted because one important part of the application is to promote items for better merchandizing technique. 3. The existing algorithm produced different combination of items according to their association with other items and their support in the database. Hence, there are redundant items being produced as an output. The existing algorithm lacks in checking this redundant items being produced. This problem is highlighted to be able to produce an output that is precise, organize and more easy to analyze. |
| 526 ## - STUDY PROGRAM INFORMATION NOTE |
| Classification |
Filipiniana |
| 540 ## - TERMS GOVERNING USE AND REPRODUCTION NOTE |
| Terms governing use and reproduction |
5 |
| 655 ## - INDEX TERM--GENRE/FORM |
| Genre/form data or focus term |
. |
| 942 ## - ADDED ENTRY ELEMENTS |
| Institution code [OBSOLETE] |
lcc |
| Item type |
Thesis/Dissertation |
| Source of classification or shelving scheme |
|