Data mining using query flocks with views

Date

2000-01-01

Author

Yetisgen, Meliha
Toroslu, İsmail Hakkı

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

35
views

0
downloads

© Springer-Verlag Berlin Heidelberg 2000.Data Mining is the process of finding trends and patterns in large data. Association rule mining become one of the most important techniques for extracting useful information such as regularities in the historical data. Query flocks extends the concept of association rule mining with a ”generate-and-test” model for many different kind of patterns. This paper further extends the query flocks with view definitions. Also, a new data mining architecture simply compiles the query flocks from datalog to SQL. On this architecture, optimizations suitable for the extended query flocks are introduced. The prototype of the system is developed on a commercial database environment. Advantages of the new design and the extension to the query flocks, together with the optimizations, are also presented.

Subject Keywords

Association rule, Total execution time, Connection graph, View evaluation, Parameterized query

URI

https://hdl.handle.net/11511/56759

DOI

https://doi.org/10.1007/3-540-44469-6_67

Collections

Department of Computer Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Frequent itemset minning with trie data structure and parallel execution with PVM Guner, Levent; Karagöz, Pınar (2007-10-03) Apriori algorithm is one of the basic algorithms introduced to solve the problem of frequent itemset mining (FIM). Since there is a new generation of affordable computers with parallel processing capability and it is easier to set up computer clusters, we can develop more efficient parallel FIM algorithms for these new systems. This paper investigates the use of trie data structure in parallel execution of Apriori algorithm, the potential problems during implementation, performance comparison of several par...
Sanayi Kümelerinde Ağlarin Mekansal Örüntüsü: İstanbul Kuyumculuk Sektörü Üretim Ağları Armatlı Köroğlu , Bilge; Özelçi Eceral , Tanyel; Varol, Çiğdem (Middle East Technical University, Faculty of Architecture, 2012-6-1) The aim of this paper is to analyse the spatial pattern of networks of Istanbul jewellery cluster, based on the data collected from the sample firms through in-depth interviews. The theoretical debates and the existing empirical studies show that, local linkages are necessary to describe the clusters. However, some of the recent studies emphasize the importance of global networks to complete the local networks in clusters. The paper focuses on two main research questions: Does the spatial pattern of network...
Fuzzy association rule mining from spatio-temporal data Calargun, Seda Unal; Yazıcı, Adnan (2008-07-03) The use of fuzzy sets in mining association rules from spatio-temporal databases is useful since fuzzy sets are able to model the uncertainty embedded in the meaning of data. There are several fuzzy association rule mining techniques that can work on spatio-temporal data. Their ability to mine fuzzy association rules has to be compared on a realistic scenario. Besides the performance criteria, other criteria that can express the quality of an association rule discovered shall be specified. In this paper, fu...
Data integration over horizontally partitioned databases in service-oriented data grids Sunercan, Hatice Kevser Sönmez; Çiçekli, Fehime Nihan; Alpdemir, Mahmut Nedim; Department of Computer Engineering (2010) Information integration over distributed and heterogeneous resources has been challenging in many terms: coping with various kinds of heterogeneity including data model, platform, access interfaces; coping with various forms of data distribution and maintenance policies, scalability, performance, security and trust, reliability and resilience, legal issues etc. It is obvious that each of these dimensions deserves a separate thread of research efforts. One particular challenge among the ones listed above tha...
Data mining in deductive databases using query flocks Toroslu, İsmail Hakkı (Elsevier BV, 2005-04-01) Data mining can be defined as a process for finding trends and patterns in large data. An important technique for extracting useful information, such as regularities, from usually historical data, is called as association rule mining. Most research on data mining is concentrated on traditional relational data model. On the other hand, the query flocks technique, which extends the concept of association rule mining with a 'generate-and-test' model for different kind of patterns, can also be applied to deduct...

Citation Formats

M. Yetisgen and İ. H. Toroslu, “Data mining using query flocks with views,” 2000, vol. 1873, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/56759.