Efficient data mining from large text databases

DOI10.1007/3-540-45884-0_6MaRDI QIDQ3044487zbMATH OpenFDO

Authors Hiroki Arimura, Hiroshi Sakamoto, S. Arikawa

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2281/22810123.htm

Mathematics Subject Classification ID

Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Efficient text mining with optimized pattern discovery
• Efficient discovery of proximity patterns with suffix arrays (extended abstract)
• scientific article; zbMATH DE number 1041844
• Efficient Algorithm for the Extraction of Association Rules in Data Mining
• Multipass algorithms for mining association rules in text databases

Cited in

(7)

• Utilizing minimum set-cover structures with several constraints for knowledge discovery on large literature databases
• Discovery of definition patterns by compressing dictionary sentences
• Recursive data mining for role identification in electronic communications
• Mining text data: Special features and patterns
• scientific article; zbMATH DE number 1754512 (Why is no real title available?)
• Efficient discovery of proximity patterns with suffix arrays (extended abstract)
• Efficient text mining with optimized pattern discovery

This page was built for publication: Efficient data mining from large text databases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3044487)