Wyniki wyszukiwania

Filtruj wyniki

  • Czasopisma
  • Data

Wyniki wyszukiwania

Wyników: 1
Wyników na stronie: 25 50 75
Sortuj wg:

Abstrakt

Traditional clustering algorithms which use distance between a pair of data points to calculate their similarity are not suitable for clustering of boolean and categorical attributes. In this paper, a modified clustering algorithm for categorical attributes is used for segmentation of customers. Each segment is then mined using frequent pattern mining algorithm in order to infer rules that helps in predicting customer’s next purchase. Generally, purchases of items are related to each other, for example, grocery items are frequently purchased together while electronic items are purchased together. Therefore, if the knowledge of purchase dependencies is available, then those items can be grouped together and attractive offers can be made for the customers which, in turn, increase overall profit of the organization. This work focuses on grouping of such items. Various experiments on real time database are implemented to evaluate the performance of proposed approach.
Przejdź do artykułu

Autorzy i Afiliacje

Juhi Singh
1
Mandeep Mittal
2

  1. Department of Computer Science, Amity School of Engineering and Technology, Delhi, India
  2. Department of Mathematics, Amity Institute of Applied Sciences, Amity University Uttar Pradesh, Noida, India

Ta strona wykorzystuje pliki 'cookies'. Więcej informacji