239 0

Full metadata record

DC FieldValueLanguage
dc.contributor.author차재혁-
dc.date.accessioned2018-07-26T04:38:22Z-
dc.date.available2018-07-26T04:38:22Z-
dc.date.issued2012-12-
dc.identifier.citationINFORMATION-AN INTERNATIONAL INTERDISCIPLINARY JOURNAL,15(11B), p5055-5069en_US
dc.identifier.issn1343-4500-
dc.identifier.urihttps://search.proquest.com/openview/04433eb361607dec02fb116ed4f050c0/1?pq-origsite=gscholar&cbl=936334-
dc.identifier.urihttps://repository.hanyang.ac.kr/handle/20.500.11754/73075-
dc.description.abstractAssociation rule mining typically targets transactional data. In order to process non-transaction data in association rule mining, interval identification for each attribute is required. Previous methods perform the interval identification and rule mining steps independently and therefore cannot reflect the change of confidence according to the interval change in discovering association rules. This leads to improper identification of the intervals of attributes, thereby making association rules of high levels of confidence missed in a mining result. In this paper, we propose a novel method to identify good intervals of attributes by performing interval identification and rule mining steps simultaneously. The proposed method adjusts the intervals of attributes during performing the two steps. This makes it possible to find good intervals, and thereby discovering more association rules of high levels of confidence. The proposed method employs hierarchical clustering to group the attributes on the right hand side (RHS) of a rule, and also performs characterization analysis to assess the goodness of each cluster. According to our experimental results with real-world data, the proposed method results in finding useful association rules more than previous methods. Also, the level of confidence of the rules found by our method is greater than those by previous methods.en_US
dc.description.sponsorshipThis work was supported by the Brain Korea 21 Project in 2011, the Mid-Career Researcher Program through the NRF (National Research Foundation) grant funded by the MEST (Ministry of Education, Science, and Technology) (Grant No. 2008-0061006), the MKE(The Ministry of Knowledge Economy), Korea, under the 'National hrd support program for convergence information technology' support program supervised by the NIPA(National IT Industry Promotion Agency) (NIPA-2011-C6150-1101-0001), and the MKE (The Ministry of Knowledge Economy), Korea & SAMSUNG ELECTRONICS CO., under IT/SW Creative research program supervised by the NIPA (National IT Industry Promotion Agency) (NIPA-2010-C1810-1003-0007).en_US
dc.language.isoenen_US
dc.publisherINT INFORMATION INSTen_US
dc.subjectData miningen_US
dc.subjectassociation rule miningen_US
dc.subjectnon-transactional databasesen_US
dc.subjectclusteringen_US
dc.subjectcharacterizationen_US
dc.titleMining association rules in non-transactional databasesen_US
dc.typeArticleen_US
dc.relation.no11B-
dc.relation.volume15-
dc.relation.page5055-5069-
dc.relation.journalINFORMATION-AN INTERNATIONAL INTERDISCIPLINARY JOURNAL-
dc.contributor.googleauthorLee, Ho-Jong-
dc.contributor.googleauthorLim, Seung-Hwan-
dc.contributor.googleauthorOh, Hyun-Kyo-
dc.contributor.googleauthorCho, Jin-Soo-
dc.contributor.googleauthorKim, Sang-Wook-
dc.contributor.googleauthorCha, Jae-Hyuk-
dc.contributor.googleauthorLee, Jung-Hoon-
dc.contributor.googleauthorKim, Han-Il-
dc.relation.code2012218316-
dc.sector.campusS-
dc.sector.daehakCOLLEGE OF ENGINEERING[S]-
dc.sector.departmentDEPARTMENT OF COMPUTER SCIENCE-
dc.identifier.pidchajh-
dc.identifier.researcherID24472530200-
Appears in Collections:
COLLEGE OF ENGINEERING[S](공과대학) > COMPUTER SCIENCE(컴퓨터소프트웨어학부) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE