Efficient text mining with optimized pattern discovery

DOI10.1007/3-540-45452-7_2MaRDI QIDQ4737683zbMATH OpenFDO

Authors Hiroki Arimura

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/2373/23730017.htm

Mathematics Subject Classification ID

Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Recommendations

• Efficient data mining from large text databases
• Mining text data: Special features and patterns
• Efficient algorithms for discovering frequent and maximal substructures from large semistructured data
• Efficient discovery of proximity patterns with suffix arrays (extended abstract)
• Technology of text mining

Cited in

(5)

• Discovering instances of poetic allusion from anthologies of classical Japanese poems
• Discovering characteristic expressions in literary works.
• Utilizing minimum set-cover structures with several constraints for knowledge discovery on large literature databases
• Efficient data mining from large text databases
• Efficient discovery of proximity patterns with suffix arrays (extended abstract)

This page was built for publication: Efficient text mining with optimized pattern discovery

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