Multi-document summarization exploiting frequent itemsets

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2012, Pages 782-786

  Baralis, Elena ^a   Cagliero, Luca ^a   Jabeen, Saima ^a   Fiori, Alessandro ^a  

^a POLITECNICO DI TORINO   (Italy)

Author keywords

frequent itemset mining; multi document summarization; text mining

Indexed keywords

DATA COLLECTION; DATA MINING TECHNIQUES; DOCUMENT COLLECTION; DOCUMENT SUMMARIZATION; FREQUENT ITEMSET MINING; ITEM SETS; MULTI-DOCUMENT; MULTI-DOCUMENT SUMMARIZATION; RELEVANCE SCORE; TEXT MINING; TEXTUAL DOCUMENTS; TRANSACTIONAL DATA;

DATA MINING;

NATURAL LANGUAGE PROCESSING SYSTEMS;

EID: 84863574381     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2245276.2245427     Document Type: Conference Paper

References (17)

1. R. Agrawal, T. Imieliński, and A. Swami. Mining association rules between sets of items in large databases. In ACM SIGMOD Record, volume 22, pages 207-216.
2. E. Baralis, G. Bruno, and A. Fiori. Minimum number of genes for microarray feature selection. 30th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, pages 5692-5695, 2008.
3. S. Bird, E. Klein, and E. Loper. Natural language processing with Python. O'Reilly Media, 2009.
4. S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. In Proceedings of the seventh international conference on World Wide Web 7, pages 107-117, 1998.
5. T. G. Dietterich. Approximate statistical test for comparing supervised classification learning algorithms. Neural Computation, 10(7), 1998.
6. Document Understanding Conference. HTL/NAACL workshop on text summarization, 2004. http://www-nlpir.nist.gov/projects/duc/pubs.html.
7. S. Jaroszewicz and D. A. Simovici. Interestingness of frequent itemsets using bayesian networks as background knowledge. In Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 178-186, 2004.
8. K. S. Jones. A statistical interpretation of term specificity and its application in retrieval. Journal of Documentation, 28:11-21, 1972.
9. C.-Y. Lin and E. Hovy. Automatic evaluation of summaries using n-gram co-occurrence statistics. In Proceedings of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1, pages 71-78, 2003.
10. M. Mampaey, N. Tatti, and J. Vreeken. Tell me what I need to know: Succinctly summarizing data with itemsets. In Proceedings of the 17th ACM Conference on Knowledge Discovery and Data Mining, 2011.
11. D. R. Radev. Lexrank: Graph-based lexical centrality as salience in text summarization. Journal of Artificial Intelligence Research, 22:2004, 2004.
12. T. Ralphs and M. Guzelsoy. The SYMPHONY callable library for mixed integer programming. The Next Wave in Computing, Optimization, and Decision Technologies, 29:61-76, 2006. Software available at http://www.coin-or.org/ SYMPHONY.
13. N. Rotem. Open text summarizer (ots). Retrieved July, 2006.
14. H. Takamura and M. Okumura. Text summarization model based on the budgeted median problem. In Proceeding of the 18th ACM conference on Information and knowledge management, pages 1589-1592, 2009.
15. N. Tatti. Probably the best itemsets. In Proceedings of the 16th ACM international conference on Knowledge discovery and data mining, pages 293-302, 2010.
16. TexLexAn. Texlexan: An open-source text summarizer, 2011.
17. D. Wang and T. Li. Document update summarization using incremental hierarchical clustering. In Proceedings of the 19th ACM international conference on Information and knowledge management, pages 279-288, 2010.