International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064


Downloads: 125 | Views: 203

M.Tech / M.E / PhD Thesis | Computer Science & Engineering | India | Volume 4 Issue 3, March 2015


Market-Basket Analysis Using Agglomerative Hierarchical Approach for Clustering a Retail Items

Rujata Saraf | Prof. Sonal Patil


Abstract: With the advent of data mining technology, cluster analysis of items is frequently done in supermarkets and in other large-scale retail sectors. Clustering of items has been a popular tool for identification of different groups of items where appropriate programs and techniques in data mining like Market-Basket analysis have been defined for each group separately with maximum effectiveness and return. For example, items frequently purchased together are placed in one place in the shelf of a retail store. There are various algorithms used for clustering. Hierarchical algorithms find successive clusters using previously established clusters. These algorithms usually are either agglomerative (bottom-up) or divisive (top-down). The paper presents the Market-Basket Analysis using Agglomerative (Bottom-up) hierarchical approach for clustering a retail items. Agglomerative hierarchical clustering creates a hierarchy of clusters which are represented in a tree structure called a Dendorogram. In agglomerative hierarchical clustering, dendrograms are developed based on the concept of distance between the entities or, groups of entities. . The clustering will done in such a way that the Purpose of Market-Basket Analysis will achieve.


Keywords: Retail Sectors, Market-Basket analysis, Hierarchical Clustering, Agglomerative Hierarchical Clustering, Dendrogram etc


Edition: Volume 4 Issue 3, March 2015,


Pages: 783 - 789


How to Download this Article?

Type Your Valid Email Address below to Receive the Article PDF Link


Verification Code will appear in 2 Seconds ... Wait

Top