Abstracting events for data mining

作者: Venkatesh-Prasad Ranganath , Kapil Vaswani , Ganesan Ramalingam , David Lo

DOI:

关键词:

摘要: An event is described herein as being representable by a quantified abstraction of the event. The includes at least one predicate, and predicate has constant symbol corresponding thereto. instance to identified, replaced free variable obtain an abstracted predicate. Thus, composed pair: mapping between that corresponds A data mining algorithm executed over abstracted, events ascertain correlation another

参考文章(16)
Ramakrishnan Srikant, Rakesh Agrawal, Fast algorithms for mining association rules very large data bases. pp. 580- 592 ,(1998)
Sriram K. Rajamani, Thomas J. Ball, Rupak Majumdar, Todd D. Millstein, System and method for generating a predicate abstraction of a program ,(2002)
Franjo Ivancic, Pranav N. Ashar, Malay K. Ganai, Aarti Gupta, Zijiang Yang, System and method for modeling, abstraction, and analysis of software ,(2005)
M. Houtsma, A. Swami, Set-oriented mining for association rules in relational databases international conference on data engineering. pp. 25- 33 ,(1995) , 10.1109/ICDE.1995.380413
H. Safyallah, K. Sartipi, Dynamic Analysis of Software Systems using Execution Pattern Mining international conference on program comprehension. pp. 84- 88 ,(2006) , 10.1109/ICPC.2006.19
S. Chaudhuri, V. Narasayya, S. Sarawagi, Efficient evaluation of queries with mining predicates international conference on data engineering. pp. 529- 540 ,(2002) , 10.1109/ICDE.2002.994772
Jinlin Yang, David Evans, Deepali Bhardwaj, Thirumalesh Bhat, Manuvir Das, Perracotta Proceeding of the 28th international conference on Software engineering - ICSE '06. pp. 282- 291 ,(2006) , 10.1145/1134285.1134325
David Lo, Siau-Cheng Khoo, Chao Liu, Efficient mining of iterative patterns for software specification discovery Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '07. pp. 460- 469 ,(2007) , 10.1145/1281192.1281243