Database Support for Data Mining Applications [electronic resource] : Discovering Knowledge with Inductive Queries / edited by Rosa Meo, Pier Luca Lanzi, Mika Klemettinen.

Contributor(s): Meo, Rosa [editor.] | Lanzi, Pier Luca [editor.] | Klemettinen, Mika [editor.] | SpringerLink (Online service)Material type: TextTextSeries: Lecture Notes in Computer Science ; 2682Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2004Description: XII, 332 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540444978Subject(s): Computer science | Database management | Information storage and retrieval systems | Artificial intelligence | Computer Science | Artificial Intelligence (incl. Robotics) | Database Management | Information Storage and RetrievalAdditional physical formats: Printed edition:: No titleDDC classification: 006.3 LOC classification: Q334-342TJ210.2-211.495Online resources: Click here to access online
Contents:
Database Languages and Query Execution -- Inductive Databases and Multiple Uses of Frequent Itemsets: The cInQ Approach -- Query Languages Supporting Descriptive Rule Mining: A Comparative Study -- Declarative Data Mining Using SQL3 -- Towards a Logic Query Language for Data Mining -- A Data Mining Query Language for Knowledge Discovery in a Geographical Information System -- Towards Query Evaluation in Inductive Databases Using Version Spaces -- The GUHA Method, Data Preprocessing and Mining -- Constraint Based Mining of First Order Sequences in SeqLog -- Support for KDD-Process -- Interactivity, Scalability and Resource Control for Efficient KDD Support in DBMS -- Frequent Itemset Discovery with SQL Using Universal Quantification -- Deducing Bounds on the Support of Itemsets -- Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data -- Condensed Representations for Sets of Mining Queries -- One-Sided Instance-Based Boundary Sets -- Domain Structures in Filtering Irrelevant Frequent Patterns -- Integrity Constraints over Association Rules.
In: Springer eBooksSummary: Data mining from traditional relational databases as well as from non-traditional ones such as semi-structured data, Web data, and scientific databases housing biological, linguistic, and sensor data has recently become a popular way of discovering hidden knowledge. This book on database support for data mining is developed to approaches exploiting the available database technology, declarative data mining, intelligent querying, and associated issues, such as optimization, indexing, query processing, languages, and constraints. Attention is also paid to the solution of data preprocessing problems, such as data cleaning, discretization, and sampling. The 16 reviewed full papers presented were carefully selected from various workshops and conferences to provide complete and competent coverage of the core issues. Some papers were developed within an EC funded project on discovering knowledge with inductive queries.
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified URL Status Date due Barcode
IMSc Library
IMSc Library
Link to resource Available EBK4868

Database Languages and Query Execution -- Inductive Databases and Multiple Uses of Frequent Itemsets: The cInQ Approach -- Query Languages Supporting Descriptive Rule Mining: A Comparative Study -- Declarative Data Mining Using SQL3 -- Towards a Logic Query Language for Data Mining -- A Data Mining Query Language for Knowledge Discovery in a Geographical Information System -- Towards Query Evaluation in Inductive Databases Using Version Spaces -- The GUHA Method, Data Preprocessing and Mining -- Constraint Based Mining of First Order Sequences in SeqLog -- Support for KDD-Process -- Interactivity, Scalability and Resource Control for Efficient KDD Support in DBMS -- Frequent Itemset Discovery with SQL Using Universal Quantification -- Deducing Bounds on the Support of Itemsets -- Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data -- Condensed Representations for Sets of Mining Queries -- One-Sided Instance-Based Boundary Sets -- Domain Structures in Filtering Irrelevant Frequent Patterns -- Integrity Constraints over Association Rules.

Data mining from traditional relational databases as well as from non-traditional ones such as semi-structured data, Web data, and scientific databases housing biological, linguistic, and sensor data has recently become a popular way of discovering hidden knowledge. This book on database support for data mining is developed to approaches exploiting the available database technology, declarative data mining, intelligent querying, and associated issues, such as optimization, indexing, query processing, languages, and constraints. Attention is also paid to the solution of data preprocessing problems, such as data cleaning, discretization, and sampling. The 16 reviewed full papers presented were carefully selected from various workshops and conferences to provide complete and competent coverage of the core issues. Some papers were developed within an EC funded project on discovering knowledge with inductive queries.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha