Abstract
Timed association rules (TARs) generalize classical association rules (ARs) so that we can express temporal dependencies of the form “If X is true at time t, then Y will likely be true at time (t+τ).” As with ARs, solving the TAR mining problem can generate huge numbers of rules. We show that methods to summarize ARs cannot work directly with TARs, and we develop two notions—strong and weak summaries—to summarize a set of TARs. We show that the problems of finding strong/weak summaries are NP-hard, and we provide polynomial-time approximation algorithms. We show experimentally that the coverage provided by our summarization methods is very high. Both technical measures based on coverage and human experiments on six World Bank datasets using 100 subjects from Mechanical Turk and a separate experiment with terrorism experts on a terrorism dataset show that while both summarization methods perform well, weak summaries are preferred, despite their taking more time to compute than strong summaries.
- Foto N. Afrati, Aristides Gionis, and Heikki Mannila. 2004. Approximating a collection of frequent sets. In KDD. 12--19.Google Scholar
- Charu C. Aggarwal and Philip S. Yu. 1998. Online generation of association rules. In ICDE. 402--411.Google Scholar
- Rakesh Agrawal, Tomasz Imielinski, and Arun N. Swami. 1993. Mining association rules between sets of items in large databases. In SIGMOD. 207--216.Google Scholar
Digital Library
- Juan M. Ale and Gustavo Rossi. 2000. An approach to discovering temporal association rules. In SAC. 294--300.Google Scholar
- Mohamed-Bachir Belaid, Christian Bessiere, and Nadjib Lazaar. 2019. Constraint programming for association rules. In SDM. 127--135.Google Scholar
- Abdelhamid Boudane, Saïd Jabbour, Lakhdar Sais, and Yakoub Salhi. 2017. Enumerating non-redundant association rules using satisfiability. In PAKDD. 824--836.Google Scholar
- Cheng-Yue Chang, Ming-Syan Chen, and Chang-Hung Lee. 2002. Mining general temporal association rules for items with different exhibition periods. In ICDM. 59--66.Google Scholar
- Gautam Das, King-Ip Lin, Heikki Mannila, Gopal Renganathan, and Padhraic Smyth. 1998. Rule discovery from time series. In KDD. 16--22.Google Scholar
- Tarek F. Gharib, Hamed Nassar, Mohamed Taha, and Ajith Abraham. 2010. An efficient algorithm for incremental mining of temporal association rules. Data Knowl. Eng. 69, 8 (2010), 800--815.Google Scholar
Digital Library
- Robert Golan and Donald Edwards. 1994. Temporal rules discovery using datalogic/R+ with stock market data. In Rough Sets, Fuzzy Sets and Knowledge Discovery. Springer, 74--81.Google Scholar
- Wilhelmiina Hämäläinen and Geoffrey I. Webb. 2017. Specious rules: An efficient and effective unifying method for removing misleading and uninformative patterns in association rule mining. In SDM. 309--317.Google Scholar
- Jiawei Han, Jian Pei, and Yiwen Yin. 2000. Mining frequent patterns without candidate generation. SIGMOD Rec. 29, 2 (2000), 1--12.Google Scholar
Digital Library
- Wei Han, Julio De Melo Borges, Peter Neumayer, Yong Ding, Till Riedel, and Michael Beigl. 2017. Interestingness classification of association rules for master data. In ICDM. 237--245.Google Scholar
- Roberto J. Bayardo Jr., Rakesh Agrawal, and Dimitrios Gunopulos. 1999. Constraint-based rule mining in large, dense databases. In ICDE. 188--197.Google Scholar
- Chang-Hung Lee, Ming-Syan Chen, and Cheng-Ru Lin. 2003. Progressive partition miner: An efficient algorithm for mining general temporal association rules. IEEE Trans. Knowl. Data Eng. 15, 4 (2003), 1004--1017.Google Scholar
Digital Library
- Chang-Hung Lee, Cheng-Ru Lin, and Ming-Syan Chen. 2001. On mining general temporal association rules in a publication database. In ICDM. 337--344.Google Scholar
- Brian Lent, Arun N. Swami, and Jennifer Widom. 1997. Clustering association rules. In ICDE. 220--231.Google Scholar
- Yingjiu Li, Peng Ning, Xiaoyang Sean Wang, and Sushil Jajodia. 2003. Discovering calendar-based temporal association rules. Data Knowl. Eng. 44, 2 (2003), 193--218.Google Scholar
Digital Library
- Bing Liu, Wynne Hsu, and Yiming Ma. 1999. Pruning and summarizing the discovered associations. In KDD. 125--134.Google Scholar
- Guimei Liu, Haojun Zhang, and Limsoon Wong. 2014. A flexible approach to finding representative pattern sets. IEEE Trans. Knowl. Data Eng. 26, 7 (2014), 1562--1574.Google Scholar
Cross Ref
- Hongjun Lu, Ling Feng, and Jiawei Han. 2000. Beyond intratransaction association analysis: Mining multidimensional intertransaction association rules. ACM Trans. Inf. Syst. 18, 4 (2000), 423--454.Google Scholar
Digital Library
- Michael Mampaey, Nikolaj Tatti, and Jilles Vreeken. 2011. Tell me what i need to know: Succinctly summarizing data with itemsets. In KDD. 573--581.Google Scholar
- Heikki Mannila, Hannu Toivonen, and A. Inkeri Verkamo. 1997. Discovery of frequent episodes in event sequences. Data Min. Knowl. Discov. 1, 3 (1997), 259--289.Google Scholar
Digital Library
- Francisco Javier Martínez-de Pisón, Andrés Sanz, Eduardo Martínez-de Pisón, Emilio Jiménez, and Dante Conti. 2012. Mining association rules from time series to explain failures in a hot-dip galvanizing steel line. Comput. Industr. Eng. 63, 1 (2012), 22--36.Google Scholar
- George L. Nemhauser, Laurence A. Wolsey, and Marshall L. Fisher. 1978. An analysis of approximations for maximizing submodular set functions—I. Math. Program. 14, 1 (1978), 265--294.Google Scholar
Digital Library
- Dang Nguyen, Wei Luo, Dinh Q. Phung, and Svetha Venkatesh. 2018. LTARM: A novel temporal association rule mining method to understand toxicities in a routine cancer treatment. Knowl. Based Syst. 161 (2018), 313--328.Google Scholar
- Iqbal H. Sarker and Flora D. Salim. 2018. Mining user behavioral rules from smartphone data through association analysis. In PAKDD. 450--461.Google Scholar
- V. S. Subrahmanian, Aaron Mannes, Amy Sliva, Jana Shakarian, and John P. Dickerson. 2012. Computational Analysis of Terrorist Groups: Lashkar-e-Taiba. Springer.Google Scholar
Digital Library
- Wei Wang, Jiong Yang, and Richard R. Muntz. 2001. TAR: Temporal association rules on evolving numerical attributes. In ICDE. 283--292.Google Scholar
- Edi Winarko and John F. Roddick. 2007. ARMADA—An algorithm for discovering richer relative temporal association rules from interval-based data. Data Knowl. Eng. 63, 1 (2007), 76--90.Google Scholar
Digital Library
- Dong Xin, Jiawei Han, Xifeng Yan, and Hong Cheng. 2005. Mining compressed frequent-pattern sets. In VLDB. 709--720.Google Scholar
- An-Shu Zhang, Wenzhong Shi, and Geoffrey I. Webb. 2016. Mining significant association rules from uncertain data. Data Min. Knowl. Discov. 30, 4 (2016), 928--963.Google Scholar
Digital Library
Index Terms
STAR: Summarizing Timed Association Rules
Recommendations
Intertopic information mining for query-based summarization
In this article, the authors address the problem of sentence ranking in summarization. Although most existing summarization approaches are concerned with the information embodied in a particular topic (including a set of documents and an associated ...
Mining summarization of high utility itemsets
Mining interesting itemsets from transaction databases has attracted a lot of research interests for decades. In recent years, high utility itemset (HUI) has emerged as a hot topic in this field. In real applications, the bottleneck of HUI mining is not ...
A query-based multi-document sentiment summarizer
CIKM '11: Proceedings of the 20th ACM international conference on Information and knowledge managementReview websites, such as Epinions.com, which offer users a platform to share their opinions on diverse products and services, provide a valuable source of opinion-rich information. Browsing through archived reviews to locate different opinions on a ...






Comments