Filters








72,390 Hits in 4.4 sec

Data Access Paths for Frequent Itemsets Discovery [chapter]

Marek Wojciechowski, Maciej Zakrzewicz
2002 Lecture Notes in Computer Science  
A number of frequent itemset discovery algorithms have been proposed in the area of data mining research.  ...  In this paper, we use the concept of materialized views to describe possible data access paths for frequent itemset discovery.  ...  The results of the data mining query have been permanently stored in the database in the form of the materialized data mining view ISETS_DMV1, created by means of the following statement.  ... 
doi:10.1007/3-540-45710-0_8 fatcat:sbnvi4xusnc2xfeyfhk6g5mxxm

Using domain knowledge in knowledge discovery

Suk-Chung Yoon, Lawrence J. Henschen, E. K. Park, Sam Makki
1999 Proceedings of the eighth international conference on Information and knowledge management - CIKM '99  
With the explosive growth of the size of databases, many knowledge discovery applications deal with large quantities of data.  ...  In this paper, we introduce a method to utilize three types of domain knowledge in reducing the cost of finding a potentially interesting and relevant portion of the data while improving the quality of  ...  When the system has to deal with large databases for knowledge discovery, there are major challenging issues, including computational efficiency and interestingness of patterns.  ... 
doi:10.1145/319950.320008 dblp:conf/cikm/YoonHPM99 fatcat:zxuqgonkfnfprhhbj7h7qfa7lu

Jumping emerging patterns with negation in transaction databases – Classification and discovery

Pawel Terlecki, Krzysztof Walczak
2007 Information Sciences  
The results are contrasted with changes in rule set complexity. In connection with the problem of JEPN discovery, JEP-Producer and rough set methods are examined.  ...  JEPNs provide an interesting type of knowledge and can be successfully used for classification purposes.  ...  Taking advantage of this correspondence, we compare the efficiency of JEPN discovery by means of JEP and local reduct finding methods.  ... 
doi:10.1016/j.ins.2007.07.018 fatcat:nl5xvj37l5fvrpvao5blcoi7m4

Discovery of "Interesting" Data Dependencies from a Workload of SQL Statements [chapter]

S. Lopes, J-M. Petit, F. Toumani
1999 Lecture Notes in Computer Science  
Discovering data dependencies consists in producing the whole set of a given class of data dependencies holding in a database, the task of selecting the interesting ones being usually left to an expert  ...  In this paper we take another look at the problems of discovering inclusion and functional dependencies in relational databases.  ...  In the sequel, the input parameters of these discovery tasks are a database r over a database schema R and the logical navigation π nav * .  ... 
doi:10.1007/978-3-540-48247-5_54 fatcat:ii4javmipzccnnwyc4z7ao2ynm

Efficiently Identifying Exploratory Rules' Significance [chapter]

Shiying Huang, Geoffrey I. Webb
2006 Lecture Notes in Computer Science  
The situation gets worse as the size of the database increases. In this paper, we propose two approaches for improving the efficiency of significant exploratory rule discovery.  ...  How to efficiently discard potentially uninteresting rules in exploratory rule discovery is one of the important research foci in data mining.  ...  Introduction Exploratory rule discovery techniques seek multiple models which are able to efficiently describe the potentially interesting inter-relationships among attributes in a database.  ... 
doi:10.1007/11677437_6 fatcat:xw2iewi3cvfo7m7ugqgjl4vwae

Rapid access to genetic discoveries underlying human disease

Heidi L. Rehm
2016 Molecular Case Studies  
With the regular identification of novel variants in patients with rare diseases, an efficient mechanism to define the spectrum of variation and the range of clinical presentations associated with previously  ...  The editors hope this new format will accelerate the dissemination of novel variants implicated in disease and also encourage the community to deposit their findings into public databases such as ClinVar  ...  Competing Interest Statement The author has declared no competing interest.  ... 
doi:10.1101/mcs.a001545 pmid:27900371 pmcid:PMC5111010 fatcat:igyl4jx6yjagpml3ypu6ckvbra

Logic based Pattern Discovery using the Integral Logical Derivative Rule

Prasadh. K, Sutheer. T
2013 International Journal of Computer Applications  
An analytical and empirical result shows the lesser execution time with the efficient integral based pattern discovery of our proposed scheme.  ...  Problem Statement: To enhance the pattern discovery process, the multi-level proposional process work extends the pattern discovery process with coherent rule generation framework.  ...  The expression KDD refers to the overall procedure of knowledge discovery in databases.  ... 
doi:10.5120/11377-6648 fatcat:d2jshydb75enlmh6ctcigkw4yy

"What makes my queries slow?": Subgroup Discovery for SQL Workload Analysis [article]

Youcef Remil, Anes Bendimerad, Romain Mathonat, Philippe Chaleat, Mehdi Kaytoue
2021 arXiv   pre-print
Automatically discovering these patterns in a huge search space and providing them as hypotheses for helping to localize issues and root-causes is important in the context of explainable AI.  ...  Among daily tasks of database administrators (DBAs), the analysis of query workloads to identify schema issues and improving performances is crucial.  ...  Interactive Subgroup Discovery V. RELATED WORK For decades, extracting interesting patterns from query workloads has been of great importance in database research.  ... 
arXiv:2108.03906v1 fatcat:xy4mlhmr25cxfeltvzp2urj6qu

On Pattern-Based Programming Towards The Discovery Of Frequent Patterns

Kittisak Kerdprasop, Nittaya Kerdprasop
2007 Zenodo  
Finding such frequent patterns has become an important data mining task because it reveals associations, correlations, and many other interesting relationships hidden in a database.  ...  The problem of frequent pattern discovery is defined as the process of searching for patterns such as sets of features or items that appear in data frequently.  ...  The performance studies also support our intuition on efficiency because our implementations are not significantly less efficient than the C and Java implementations in terms of speed and memory usage.  ... 
doi:10.5281/zenodo.1077711 fatcat:ktbu7uqboza2fpej75lhf73jcq

Processing frequent itemset discovery queries by division and set containment join operators

Ralf Rantzau
2003 Proceedings of the 8th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery - DMKD '03  
, which are not yet available in commercial database systems.  ...  We argue that expressing the frequent itemset discovery problem using quantifications offers interesting opportunities to process such queries using set containment join or set containment division operators  ...  We plan to develop more efficient implementations of the operator in the future.  ... 
doi:10.1145/882082.882089 dblp:conf/dmkd/Rantzau03 fatcat:3jmehcjs2bgrhpe45dchapx5qq

Processing frequent itemset discovery queries by division and set containment join operators

Ralf Rantzau
2003 Proceedings of the 8th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery - DMKD '03  
, which are not yet available in commercial database systems.  ...  We argue that expressing the frequent itemset discovery problem using quantifications offers interesting opportunities to process such queries using set containment join or set containment division operators  ...  We plan to develop more efficient implementations of the operator in the future.  ... 
doi:10.1145/882088.882089 fatcat:fuxligry7fbb5adys634nibyqm

KDD-93: Progress and Challenges in Knowledge Discovery in Databases

Gregory Piatetsky-Shapiro, Christopher J. Matheus, Padhraic Smyth, Ramasamy Uthurusamy
1994 The AI Magazine  
We thank Peter Patel-Schneider for his editorial guidance and rapid processing of this article.  ...  Shapiro 1992) devoted or closely related to discovery in databases. The application side is of interest to any business or organization with large databases.  ...  Willi Kloesgen (GMD, Germany) described rule-refinement and ruleoptimization strategies in EXPLORA, an interactive system for the discovery of interesting patterns in databases.  ... 
doi:10.1609/aimag.v15i3.1103 dblp:journals/aim/Piatetsky-ShapiroMSU94 fatcat:5z6dsg5n6nhbreuxnlw3rnlwdq

An Algorithm for the Discovery of Independence from Data [article]

Miika Hannula, Bor-Kuan Song, Sebastian Link
2021 arXiv   pre-print
For years, independence has been considered as an important concept in many disciplines. Nevertheless, we present the first research that investigates the discovery problem of independence in data.  ...  In its arguably simplest form, independence is a statement between two sets of columns expressing that for every two rows in a table there is also a row in the table that coincides with the first row on  ...  3) data profiling is an area of interest for researchers and practitioners, and while the discovery problem of many database constraints has been extensively studied in the past, this has not been the  ... 
arXiv:2101.02502v1 fatcat:ih6lsppvsfdq3ih3q3zs5dszs4

BiQL: A Query Language for Analyzing Information Networks [chapter]

Anton Dries, Siegfried Nijssen, Luc De Raedt
2012 Lecture Notes in Computer Science  
One of the key steps in data analysis is the exploration of data.  ...  However, for the exploration of graph data, relational databases may not be most practical and scalable.  ...  However, due to the overall complexity of object databases, there are few systems that fully support the OQL standard. Recently, there is a increasing interest in so-called NoSQL databases.  ... 
doi:10.1007/978-3-642-31830-6_11 fatcat:c3sznsv2sjazvcszogye4ljpcy

The application agents and web services based on ontology

WANG Yi, Huijuan SUN
2012 International Journal of Education and Management Engineering  
In this information-exploding era, the user expects to spend short time retrieving really useful information rather than spending plenty of time and ending up with lots of garbage information.  ...  The purpose of this paper is firstly to highlight the problems that hamper the application of agents and web services separately.  ...  Compared with databases, ontology is more efficient and flexible in capturing and managing knowledge about concepts in the domain and relationships between these concepts.  ... 
doi:10.5815/ijeme.2012.01.03 fatcat:rl4e7ue6wjhrjgefegry3ardom
« Previous Showing results 1 — 15 out of 72,390 results