Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
TBAR: An efficient method for association rule mining in relational databases
Data & Knowledge Engineering
Introduction to Modern Information Retrieval
Introduction to Modern Information Retrieval
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Joe Celko's SQL for Smarties: Advanced SQL Programming
Joe Celko's SQL for Smarties: Advanced SQL Programming
A New Semantic Representation for Short Texts
DaWaK '08 Proceedings of the 10th international conference on Data Warehousing and Knowledge Discovery
Semantic Enrichment of Database Textual Attributes
FQAS '09 Proceedings of the 8th International Conference on Flexible Query Answering Systems
Semantic processing of database textual attributes using wikipedia
FQAS'11 Proceedings of the 9th international conference on Flexible Query Answering Systems
Hi-index | 0.00 |
In this paper, we present a mechanism to deal with short text structures in relational databases. Text fields are transformed into a special knowledge representation named AP-structure based on the Apriori algorithm of the mining area. Once the abstract data type is obtained, the text fields can be summarized, mined, and queried in a easy way. The operations to query these fields are the main aim of this paper.