Please use this identifier to cite or link to this item: https://repository.iimb.ac.in/handle/2074/11873
DC FieldValueLanguage
dc.contributor.authorNatarajan, Rajesh
dc.contributor.authorShekar, B
dc.date.accessioned2020-04-27T06:32:40Z-
dc.date.available2020-04-27T06:32:40Z-
dc.date.issued2008
dc.identifier.isbn9781424426607
dc.identifier.isbn9781424426591
dc.identifier.urihttps://repository.iimb.ac.in/handle/2074/11873-
dc.description.abstractIn this paper we present a clustering-based approach to mitigate the 'rule immensity' and the resulting 'understandability' problem in association rule (AR) mining. Clustering 'similar' rules facilitates exploration of connections among rules and the discovery of underlying structures. We first introduce the notion of 'tightness' of an AR. It reveals the strength of binding between various items present in an AR. We elaborate on its usefulness in the retail market-basket context and develop a distance-function on the basis of 'tightness.' Usage of this distance function is exemplified by clustering a small artificial set of ARs with the help of average-linkage method. Clusters thus obtained are compared with those obtained by running a standard method (from recent data mining literature) on the same data set. ©2008 IEEE.
dc.publisherIEEE
dc.subjectDairy products
dc.subjectDistance measurement
dc.subjectMarketing and sales
dc.subjectAssociation rules
dc.subjectDatabases
dc.subjectMerging
dc.subjectEquations
dc.titleTightness: A novel heuristic and a clustering mechanism to improve the interpretation of association rules
dc.typePresentation
dc.relation.conference2008 IEEE International Conference on Information Reuse and Integration: 13-15 July, 2008, Las Vegas, NV, USA
dc.relation.publication2008 IEEE International Conference on Information Reuse and Integration, IEEE IRI-2008-
dc.identifier.doi10.1109/IRI.2008.4583048
dc.pages308-313p.
Appears in Collections:2000-2009
Show simple item record

Google ScholarTM

Check

Altmetric


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