Finding of K-Most Demanding Products using Greedy Algorithm |
Author(s): |
V. Jayanthi , SELVAMM ARTS AND SCIENCE COLLEGE,NAMAKKAL,TAMIL NADU,INDIA; K. K. Kavitha, SELVAMM ARTS AND SCIENCE COLLEGE,NAMAKKAL,TAMIL NADU,INDIA |
Keywords: |
Products, Customer satisfaction bit, Minimum support, Performance evaluation and Top k |
Abstract |
Data mining offers a facility to find most demanding products from the number of products based on the customer satisfaction in a particular organization or company to improve production plans [1]. The main objective of this research is to improve the execution time from the previous method by eliminating the products which are not possible to enter top-k list using minimum support threshold concept in greedy algorithm. |
Other Details |
Paper ID: IJSRDV4I90302 Published in: Volume : 4, Issue : 9 Publication Date: 01/12/2016 Page(s): 523-524 |
Article Preview |
|
|