A database perspective on knowledge discovery

@article{Imielinski1996ADP,
  title={A database perspective on knowledge discovery},
  author={T. Imielinski and H. Mannila},
  journal={Commun. ACM},
  year={1996},
  volume={39},
  pages={58-64}
}
DATABASE MINING IS NOT SIMPLY ANOTHER buzzword for statistical data analysis or inductive learning. Database mining sets new challenges to database technology: new concepts and methods are needed for query languages, basic operations, and query processing strategies. The most important new component is the ad hoc nature of knowledge and data discovery (KDD) queries and the need for efficient query compilation into a multitude of existing and new data analysis methods. Hence, database mining… Expand
Inductive databases: towards a new generation of databases for knowledge discovery
  • R. Meo
  • Computer Science
  • 16th International Workshop on Database and Expert Systems Applications (DEXA'05)
  • 2005
TLDR
The goal of inductive databases is to assist the deployment of the KDD process and integrate several heterogeneous data mining and data analysis tools, and the current state of the art of the research in databases support for KDD is overviewed. Expand
Query Languages Supporting Descriptive Rule Mining: A Comparative Study
TLDR
A comparison between three query languages (MSQL, DMQL and MINE RULE) that have been proposed for descriptive rule mining and discussed their common features and differences are provided. Expand
A Framework for Database Mining (Abstract)
TLDR
This abstract outlines a framework for implementing database mining algorithms which are able to operate directly against data held in relational database systems and therefore no longer restrict the size of the data set which can be manipulated. Expand
Constraint-Based Discovery and Inductive Queries: Application to Association Rule Mining
Recently inductive databases (IDBs) have been proposed to afford the problem of knowledge discovery from huge databases. Querying these databases needs for primitives to: (1) select, manipulate andExpand
Inductive database languages: requirements and examples
TLDR
A list of desirable properties to be taken into account in the definition of an IDB framework are drawn, such as the expressiveness of the language in representing data and models, the closure principle, and the capability to provide a support for an efficient algorithm programming. Expand
Querying Inductive Databases: A Case Study on the MINE RULE Operator
TLDR
A comprehensive framework in which all these steps of knowledge discovery in databases can be carried out by means of queries over an inductive database, and considers the research on the MINE RULE operator by Meo, Psaila and Ceri. Expand
Database Support for Data Mining Applications
TLDR
This work presents a synthetic view on important concepts that have been studied within the cInQ European project when considering the pattern domain of itemsets, and introduces the concepts of pattern domain, evaluation functions, primitive constraints, inductive queries and solvers for itemsets. Expand
Chapter 32 DATA MINING QUERY LANGUAGES
TLDR
This chapter surveys different proposals of query languages made to support the more or less declarative specification of both data and pattern manipulations in the prolific field of association rule mining. Expand
Data Mining Query Languages
TLDR
This chapter surveys different proposals of query languages made to support the more or less declarative specification of both data and pattern manipulations in the prolific field of association rule mining. Expand
Scalable mining for classification rules in relational databases
  • Min Wang, B. Iyer, J. Vitter
  • Computer Science
  • Proceedings. IDEAS'98. International Database Engineering and Applications Symposium (Cat. No.98EX156)
  • 1998
TLDR
This work proposes a novel classification algorithm (classifier) called MIND (MINing in Databases), which can be phrased in such a way that its implementation is very easy using the extended relational calculus SQL, and this in turn allows the classifier to be built into a relational database system directly. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 13 REFERENCES
Metaqueries for Data Mining
TLDR
This chapter presents a framework that uses metaqueries to integrate inductive learning methods with deductive database technologies in the context of knowledge discovery from databases, and describes in detail a system that uses this idea to unify a Bayesian Data Cluster with the Logical Data Language (LDL++). Expand
Database Mining: A Performance Perspective
TLDR
The authors' perspective of database mining as the confluence of machine learning techniques and the performance emphasis of database technology is presented and an algorithm for classification obtained by combining the basic rule discovery operations is given. Expand
A New SQL-like Operator for Mining Association Rules
TLDR
This work proposes a unifying model that enables a uniform description of the problem of discovering association rules, and provides SQL-like operator, named MINE RULE, which is capable of expressing all the problems presented so far in the literature concerning the mining of association rules. Expand
Knowledge discovery from telecommunication network alarm databases
TLDR
The TASA (Telecommunication Network Alarm Sequence Analyzer) system for discovering and browsing knowledge from large alarm databases is described, built on the basis of viewing knowledge discovery as an interactive and iterative process, containing data collection, pattern discovery, rule postprocessing, etc. Expand
An Efficient Algorithm for Mining Association Rules in Large Databases
TLDR
This paper presents an efficient algorithm for mining association rules that is fundamentally different from known algorithms and not only reduces the I/O overhead significantly but also has lower CPU overhead for most cases. Expand
Mining association rules between sets of items in large databases
TLDR
An efficient algorithm is presented that generates all significant association rules between items in the database of customer transactions and incorporates buffer management and novel estimation and pruning techniques. Expand
Developing Tightly-Coupled Data Mining Applications on a Relational Database System
We present a methodology for tightly coupling data mining applications to database systems to build high-performance applications, without requiring any change to the database software.
Disovery board application programming interface and query language for database mining
  • Proceedings of KDD96
  • 1996
Fast Discovery of Association Rules
A Theory of Clausal Discovery
...
1
2
...