SEMMDPREF: algorithm to filter and sort rules using a semantically based ontology technique
Pages 29 - 34
Abstract
Decision Support System designs the means and methods to go through a series of processes with the purpose of satisfying the needs of the decision-makers. Most of the existing algorithms mining rules usually produce a large number of rules suffering from the problems of thresholding, redundancy, and overlapping. There is likelihood that some of these rules are already known and hence trivial and some may be meaningless altogether. To tackle these problems, this paper suggests an approach to discover interesting rules by pruning and filtering them. The approach consists of introducing methods and techniques based on semantic significance, the notion of dominance between rules and user-preference. Our approach neither favors nor excludes any measures. More importantly, specifications of threshold are easier to deal with. Concerning algorithm evaluation, we use a real database, and we compare our results with others of other algorithms such as the Most Dominant and Preferential Rules:"MDPREFR".
References
[1]
Kamber, M. and Han, J. 2006. Data Mining: Concept and Techniques, 2d ed., vol. 6, Publishers, Ed., Munich, Germany: The Morgan Kaufmann Series in Data Management Systems, 2006.
[2]
Mohammed, M., Taoufiq, G., Youssef, B., & Mohamed, E. F. 2015. A new way to select the valuable association rules. In Proceedings of the Knowledge and Smart Technology (KST), 2015 7th International Conference on, (the Tide Resort, Chonburi, Thailand, January 27--30, 2015). 2015 7th KST. IEEE, Chonburi, 81--86. DOI= 10.1109/KST.2015.7051464
[3]
Marinica, C., and Guillet, F. 2010. Knowledge-based interactive postmining of association rules using ontologies., IEEE Trans. On Knowledge and Data Engineering. 22, 6 (June 2010), 784--797.
[4]
Bouker, S., Saidi, R., Yahia, S. B., and Nguifo, E. M. 2013. Towards a semantic and statistical selection of association rules. arXiv preprint arXiv:1305.5824.
[5]
Zaki, M. J. (2004). Mining non-redundant association rules. Data mining and knowledge discovery, 9, 3 (November 2004), 223--248.
[6]
Ordonez, C., Ezquerra, N., and Santana, C. A. 2006. Constraining and summarizing association rules in medical data. Knowledge and Info. Syst. 9, 3 (March 2006) 1--2.
[7]
Bouker, S., Saidi, R., Ben Yahia, S., & Mephu Nguifo, E. (2014). Mining Undominated Association Rules Through Interestingness Measures. Inter. J. on Artif. Intel. Tools, 23, 04 (August 2014), 1460011_1-1460011_22. DOI= 10.1142/S0218213014600112
[8]
Fankam, C., Bellatreche, L., Hondjack, D., Ameur, Y. A., & Pierra, G. 2009. SISRO, conception de bases de données à partir d'ontologies de domaine. Technique et Science Informatiques, 28, 10 (October 2009) 1233--1261.
[9]
Sadoun, D. 2014. Des spécifications en langage naturel aux spécifications formelles via une ontologie comme model pivot. Doctoral Thesis. UMI Order Number: UMI Order N°. 2014PA112116., University of Paris XI.
[10]
Maedche, A., and Staab S. Ontology Learning for the Semantic Web. IEEE Intelligent Syst. 16, 2 (Mars 2001), 72--79. DOI= 10.1109/5254.920602
[11]
De Amo, S., Diallo, M. S., Diop, C. T., Giacometti, A., Li, D., & Soulet, A. (2015). Contextual preference mining for user profile construction. J. Info. Syst. 49, (April 2015) 182--199. journal homepage: www.elsevier.com/locate/infosys
[12]
Bellandi, A., Furletti, B. and Grossi, V. Ontology-driven association rules extraction: a case of study In the proceeding of the 2007 workshop on Contexts and Ontologies Representation and Reasoning (Roskilde University, Denmark, August 21, 2007). C&O:RR-2007. Denmark, 5--14.
[13]
Ng, R. T., Lakshmanan, L. V., Han, J. and Pang, A. Exploratory mining and pruning optimizations of constrained associations rules. In Proceedings of the 1998 ACM SIGMOD international conference on Management of data (Seattle, Washington, June 2-4, 1998). SIGMOD1998. Seattle, Washington, 13--24.
[14]
Chen, X. Zhou, X. Scher, R. and Geller, J. Using an interest Ontology for Improved Support in Rule Mining, In Proceedings of the 5th International Conference of Data Warehousing and Knowledge Discovery (Prague, Czech Republic, September 3-5, 2003). DaWaK 2003. Prague, Czech Republic, 320--329.
[15]
Hou, X., Gu, J., Shen, X., & Yan, W. (2005). Application of data mining in fault diagnosis based on ontology. In Proceedings of the Third International Conference on Information Technology and Applications (Sydney, Australia, July 4-7, 2005). ICITA'05. IEEE, Sydney, Australia, 260--263
[16]
Chen, P., Verma, R. M., Meininger, J. C., & Chan, W. 2008. Semantic Analysis of Association Rules. In Proceeding of Twenty-First International Florida Artificial Intelligence Research Society Conference (Coconut Grove, USA. May 15--17, 2008). FLAIRS'21, Coconut Grove, Florida. USA. AAAI Press, 270--275, 2008.
[17]
Swartout, B., Ramesh, P., K. Knight, K. and Russ, T. 1997. Toward distributed use of large-scale ontologies. In the proceeding of AAAI Symposium on Ontological Engineering (Stanford University, California. March 24 - 26, 1997)
Recommendations
Simple association rules (SAR) and the SAR-based rule discovery
Association rule mining is one of the most important fields in data mining and knowledge discovery in databases. Rules explosion is a problem of concern, as conventional mining algorithms often produce too many rules for decision makers to digest. ...
Relation rule mining
Relationships between objects constitute an important component of domain knowledge and represent an added value to data and knowledge discovery and management. Some existing studies in data mining (including association rule mining) exploit domain ...
Generating a Condensed Representation for Association Rules
Association rule extraction from operational datasets often produces several tens of thousands, and even millions, of association rules. Moreover, many of these rules are redundant and thus useless. Using a semantic based on the closure of the Galois ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
October 2015
271 pages
ISBN:9781450334808
DOI:10.1145/2857218
- Conference Chairs:
- Richard Chbeir,
- Yannis Manolopoulos,
- Victor Pellegrini Mammana,
- Eduardo Antonio Modena,
- Program Chairs:
- Agma Traina,
- Oscar Salviano,
- Youakim Badr,
- Frederic Andres
Copyright © 2015 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
- The French Chapter of ACM Special Interest Group on Applied Computing
- IFSP: Federal Institute of São Paulo
In-Cooperation
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 25 October 2015
Check for updates
Author Tags
Qualifiers
- Short-paper
Conference
MEDES '15
Sponsor:
- IFSP
MEDES '15: The 7th International Conference on Management of computational and collective IntElligence in Digital EcoSystems
October 25 - 29, 2015
Caraguatatuba, Brazil
Acceptance Rates
MEDES '15 Paper Acceptance Rate 13 of 64 submissions, 20%;
Overall Acceptance Rate 267 of 682 submissions, 39%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 28Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 01 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in