Open Access Open Access  Restricted Access Subscription or Fee Access

Classification Rule-Mining to Portend the Missing Items

S. Sivaranjani, D. Palanikkumar


This paper deals with the shopping cart in which an item can be chosen in advance and made available for the customer for buying an item which he/she is going to buy. It describes about the market basket in which the similar items are grouped together and they lead a group. It uses the Association Rule in which the common items are held in a group and provides a chance for the customer to choose one among them. This can be done with the help of certain percentage amount of buying the same thing by the regular customer. It uses a specialized algorithm for providing the association methodology. A commonly-used and naive solution to process data with missing attribute values is to ignore the instances which contain missing attribute values. This method may neglect important information within the data and a significant amount of data could be easily discarded. Some methods, such as assigning the most common values or assigning an average value to the missing attribute, make good use of all the available data. However the assigned value may not come from the information which the data originally derived from, thus noise is brought to the data.


Association rule mining (ARM),classification rule mining.

Full Text:



S. Noel, V.V. Raghavan, and C.H. Chu, “Visualizing Association Mining Results through Hierarchical Clusters,” Proc. Int’l Conf. Data Mining (ICDM ’01) pp. 425-432, Nov./Dec. 2001. P. Bollmann-Sdorra, A. Hafez, and V.V. Raghavan, “A Theoretical

Framework for Association Mining Based on the Boolean Retrieval Model,” Data Warehousing and Knowledge Discovery: Proc. Third Int’l Conf. (DaWaK ’01), pp. 21-30, Sept. 2001. R. Agrawal, T. Imielinski, and A. Swami, “Mining Association.

Rules between Sets of Items in Large Databases,” Proc. ACM Special Interest Group on Management of Data (ACM SIGMOD),pp. 207-216, 1993.

A. Rozsypal and M. Kubat, “Association Mining in Time-Varying Domains,” Intelligent Data Analysis, vol. 9, pp. 273-288, 2005.

V. Raghavan and A. Hafez, “Dynamic Data Mining,” Proc. 13th Int’l Conf. Industrial and Eng. Applications of Artificial Intelligence and Expert Systems IEA/AIE, pp. 220-229, June 2000.

C.C. Aggarwal, C. Procopius, and P.S. Yu, “Finding Localized Associations in Market Basket Data,” IEEE Trans. Knowledge and Data Eng., vol. 14, no. 1, pp. 51-62, Jan./Feb. 2002.

R. Bayardo and R. Agrawal, “Mining the Most Interesting Rules,”Proc. ACM SIGKDD Int’l Conf. Knowledge Discovery and Data Mining, pp. 145-154, 1999.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.