CFP last date
22 April 2024
Call for Paper
May Edition
IJCA solicits high quality original research papers for the upcoming May edition of the journal. The last date of research paper submission is 22 April 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

A Soft Set Model for Interesting Rules: A Case Study on Post Operative Patient Data

Published on January 2013 by Satya Ranjan Dash, Susil Rayaguru, Satchidananda Dehuri
journal_cover_thumbnail

International Conference in Distributed Computing and Internet Technology 2013
Foundation of Computer Science USA
ICDCIT - Number 1
January 2013
Authors: Satya Ranjan Dash, Susil Rayaguru, Satchidananda Dehuri
6fdff963-50d5-4c41-8203-7387641bcda0

Satya Ranjan Dash, Susil Rayaguru, Satchidananda Dehuri . A Soft Set Model for Interesting Rules: A Case Study on Post Operative Patient Data. International Conference in Distributed Computing and Internet Technology 2013. ICDCIT, 1 (January 2013), 35-39.

@article{
author = { Satya Ranjan Dash, Susil Rayaguru, Satchidananda Dehuri },
title = { A Soft Set Model for Interesting Rules: A Case Study on Post Operative Patient Data },
journal = { International Conference in Distributed Computing and Internet Technology 2013 },
issue_date = { January 2013 },
volume = { ICDCIT },
number = { 1 },
month = { January },
year = { 2013 },
issn = 0975-8887,
pages = { 35-39 },
numpages = 5,
url = { /proceedings/icdcit/number1/10240-1007/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 International Conference in Distributed Computing and Internet Technology 2013
%A Satya Ranjan Dash
%A Susil Rayaguru
%A Satchidananda Dehuri
%T A Soft Set Model for Interesting Rules: A Case Study on Post Operative Patient Data
%J International Conference in Distributed Computing and Internet Technology 2013
%@ 0975-8887
%V ICDCIT
%N 1
%P 35-39
%D 2013
%I International Journal of Computer Applications
Abstract

The proposed model is mining the interesting association rules based on soft set theory. We have introduced a threshold function in the aforesaid model to eliminate the user defined threshold value for minimum support and confidence to discover interesting rules. In addition, a preprocessing step has been carried out for transforming the quantitative data into Boolean-valued data i. e. , all entries of the dataset is holding either a value 0 or 1. This method is validated through a case study on postoperative patient data retrieved from UCI machine learning repository.

References
  1. Molodtsov, D. , 1999. Soft set theory-first results, Computers and Mathematics with Applications 37 pp. 19–31.
  2. Han, J. , Kamber, M. 2010. Data Mining Concepts and Techniques, Morgan Kaufmann Publishers, ISBN 978-81-312-0535-8
  3. Herawan, T. , Mat Deris, M. 2011. A soft set approach of association rule mining, Knowledge-Based System, vol 24, 1, pp. 186-195.
  4. Maji, P. K. , Roy, A. R. 2002. An application of soft sets in a decision making problem, volume 44, Issues 8–9, , Pages 1077–1083.
  5. Noda, E. , Freitas, A. A. and Lopes, H. S. 1999 "Discovering interesting prediction rules with a genetic algorithm", proc. IEEE Congr. Evolutionary Comput. CEC '99, pp. 1322-1329.
  6. Cheung, Y. and Fu, A. 2004. "Mining frequent itemsets without support threshold: With and without item constraints," IEEE Transactions on Knowledge and Data Engineering.
  7. Zhang, S. , Lu, J. and Zhang, C. 2004. "A fuzzy-logic-based method to acquire user threshold of minimum-support for mining association rules", Information Sciences.
  8. Feldman, R. , Aumann, Y. , Amir, A. , Zilberstein, A. and Klosgen, W. 1999. "Maximal association rules: a new tool for mining for keywords co-occurrences in document collections," in: The Proceedings of the KDD pp. 167–170.
  9. Guan, J. W. , Bell, D. A. and Liu, D. Y. 2005. The rough set approach to association rule mining, in: The Proceedings of the Third IEEE International Conference on Data Mining (ICDM'03), pp. 529–532.
  10. Han, J. , Pei, J. and Yin, Y. 2000. Mining frequent patterns without candidate generation. In Proceedings of the ACM SIGMOD International Conference on Management of Data, Dallas, TX, USA, pp 1–12.
  11. Park, J. , Chen, M. and Yu, P. 1997. Using a hash–based method with transaction trimming for mining association rules. IEEE Trans. , Knowledge and Data Eng. 9(5): pp. 813–824.
  12. Bi, Y. , Anderson,T. and McClean, S. 2003. A rough set model with ontologies for discovering maximal association rules in document collections, Knowledge-Based Systems 16 pp. 243–251.
  13. Agrawal, R. , Imielinski, T. and Swami, A. . 1993. "Mining association rules between sets of items in large databases", In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pages 207–216.
  14. Au, W. and Chan, C. 2002. "An evolutionary approach for discovering changing patterns in historical data" In Proceedings , SPIE, pp. 398–409.
  15. Silverstein, C. , Brin, S. and Motwani, R. 1998. "Beyond market baskets: Generalizing association rules to dependence rules", Data Mining and Knowledge Discovery, pp. 39–68.
  16. Post Operative Dataset http://archive. ics. uci. edu/ml/datasets/Post-Operative+Patient
Index Terms

Computer Science
Information Sciences

Keywords

Soft Set Association Rule Mining Interesting Rule