Repetition support and mining cyclic patterns

Date

2003-10-01

Author

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

133
views

0
downloads

For customer transaction database, the support (customer support) of the sequential pattern is defined as the fraction of the customers supporting the sequence. We define new forms of the mining patterns, called cyclic patterns, as an extension to the sequential pattern mining by introducing a new parameter, the repetition support. For customer transaction database, the repetition support specifies the minimum number of repetitions of the patterns in each customer transaction sequence. Repeated patterns can also be viewed as cyclic since the beginning of a sequence will follow the end of the previous occurrence of the same sequence. In this paper, we introduce the repetition support parameter, the cyclic pattern mining problem, describe the related algorithms, and at the end of the paper we give some performance results.

Subject Keywords

General Engineering, Artificial Intelligence, Computer Science Applications

URI

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

Journal

EXPERT SYSTEMS WITH APPLICATIONS

DOI

https://doi.org/10.1016/s0957-4174(03)00072-1

Collections

Department of Computer Engineering, Article

Suggestions

OpenMETU
Core

ILP-based concept discovery in multi-relational data mining Kavurucu, Yusuf; Karagöz, Pınar; Toroslu, İsmail Hakkı (Elsevier BV, 2009-11-01) Multi-relational data mining has become popular due to the limitations of propositional problem definition in structured domains and the tendency of storing data in relational databases. Several relational knowledge discovery systems have been developed employing various search strategies, heuristics, language pattern limitations and hypothesis evaluation criteria, in order to cope with intractably large search space and to be able to generate high-quality patterns. In this work, an ILP-based concept discov...
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...
Semantic information-based alternative plan generation for multiple query optimization Polat, Faruk; Alhajj, R (Elsevier BV, 2001-09-01) This paper addresses the impact of semantic information about queries on alternative plan generation (APG) for multiple query optimization (MQO). MQO covers optimizing the execution of a set of queries together where each query in the set to be optimized has several alternative execution plans. A multiple query optimizer selects an alternative plan for each query to obtain an optimal global execution plan. Our approach uses information such as common relations, common possible joins and common conditions to...
Mining cyclically repeated patterns Toroslu, İsmail Hakkı (2001-01-01) © Springer-Verlag Berlin Heidelberg 2001.In sequential pattern mining, the support of the sequential pattern for the transaction database is defined only by the fraction of the customers supporting this sequence, which is known as the customer support. In this paper, a new parameter is introduced for each customer, called as repetition support, as an additional constraint to specify the minimum number of repetitions of the patterns by each customer. We call the patterns discovered using this technique as cy...
Performance analysis of a power aware routing protocol for ad hoc networks Yazıcı, Mehmet Akif; Bilgen, Semih; Department of Electrical and Electronics Engineering (2006) In this thesis, performance of the Contribution Reward Routing Protocol with Shapley Value (CAP-SV), a power-aware routing protocol for ad hoc networking is analyzed. Literature study on ad hoc network routing and ower-awareness is given. The overhead induced by the extra packets of the redirection mechanism of CAP-SV is formulized and the factors affecting this overhead are discussed. Then, the power consumption of CAP-SV is analytically analized using a linear power consumption model. It is shown that CAP...

Citation Formats

İ. H. Toroslu, “Repetition support and mining cyclic patterns,” EXPERT SYSTEMS WITH APPLICATIONS, pp. 303–311, 2003, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/43125.