Data mining using query flocks with views

Download
093044.pdf
2000
Yetişgen, Meliha
Show full item record
69
views
0
downloads
https://hdl.handle.net/11511/2719
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

Data mining using query flocks with views
Yetisgen, Meliha; Toroslu, İsmail Hakkı (2000-01-01)
© 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 t...
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...
Data Mining in Deductive Databases Using Query Flocks: Extended Abstract
Toroslu, İsmail Hakkı (2002-12-01)
An important technique for extracting useful information, such as regularities, from usually historical data, is called as association rule mining. 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 deductive databases. In this paper, query flocks technique is extended further, with view definitions including recursive views. We have designed architecture to compile query flocks from datalog...
Data mining for regional and graph-structured data objects
Dinler, Dery; Tural, Mustafa Kemal; Department of Industrial Engineering (2019)
Three research problems are addressed in this study. The first one is a semi-supervised clustering problem with instance-level constraints where each data object is either a closed convex bounded polytope or a closed disk. We first model the problem of computing the centroid of a given cluster as a second order cone programming problem. Also, a subgradient algorithm is adopted for its faster solution. We then propose a mixed-integer second order cone programming formulation and six heuristic approaches for ...
Data hiding using trellis coded quantization
Esen, E; Alatan, Abdullah Aydın (2004-10-27)
Information theoretic tools lead to the design and analysis of new blind data hiding methods. A novel quantizationbased blind method, which uses trellis coded quantization, is proposed in this manuscript. The redundancy in initial state selection during trellis coded quantization is exploited to hide information as the index of this initial state. This index is recovered at the receiver by Viterbi decoding after comparison with all initial states. The performance of the proposed method is compared against o...
Citation Formats
M. Yetişgen, “Data mining using query flocks with views,” Middle East Technical University, 2000.
METU IIS - Integrated Information Service open@metu.edu.tr