The week's pick
Reseach Article
A Soft Set Model for Interesting Rules: A Case Study on Post Operative Patient Data
| 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.
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
- Molodtsov, D. , 1999. Soft set theory-first results, Computers and Mathematics with Applications 37 pp. 19â31.
- Han, J. , Kamber, M. 2010. Data Mining Concepts and Techniques, Morgan Kaufmann Publishers, ISBN 978-81-312-0535-8
- Herawan, T. , Mat Deris, M. 2011. A soft set approach of association rule mining, Knowledge-Based System, vol 24, 1, pp. 186-195.
- 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.
- 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.
- Cheung, Y. and Fu, A. 2004. "Mining frequent itemsets without support threshold: With and without item constraints," IEEE Transactions on Knowledge and Data Engineering.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- Au, W. and Chan, C. 2002. "An evolutionary approach for discovering changing patterns in historical data" In Proceedings , SPIE, pp. 398â409.
- 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.
- Post Operative Dataset http://archive. ics. uci. edu/ml/datasets/Post-Operative+Patient
Index Terms
Keywords