Mining cyclically repeated patterns

Date

2001-01-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

155
views

0
downloads

© 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 cyclically repeated patterns. The additional parameter makes the new mining technique more efficient and also helps discovering more useful patterns by reducing the number of patterns searched. Also, ordinary sequential pattern mining can be represented as a special case of the cyclically repeated pattern mining. In this paper, we introduce the concept of mining cyclically repeated patterns, we describe the related algorithms, and at the end of the paper we give some performance results.

URI

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

DOI

https://doi.org/10.1007/3-540-44801-2_9

Collections

Department of Computer Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Repetition support and mining cyclic patterns Toroslu, İsmail Hakkı (Elsevier BV, 2003-10-01) 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...
Serializability of nested transactions in multidatabases Halıcı, Uğur; Dogac, Asuman (1997-01-01) © Springer-Verlag Berlin Heidelberg 1997.The correctness of nested transactions for multidatabases differs from that of flat transactions in that, for nested transactions the execution order of siblings at each related site should also be consistent. In this paper we first propose a simple but powerful theory for the serializability of nested transactions in multidatabases and then a technique called Nested Tickets Method for Nested Transactions (NTNT). The NTNT technique provides correctness of nested tran...
Performance analysis of elliptic curve multiplication algorithms for elliptic curve cryptography Özcan, Ayça Bahar; Yücel, Melek D; Department of Electrical and Electronics Engineering (2006) Elliptic curve cryptography (ECC) has been introduced as a public-key cryptosystem, which offers smaller key sizes than the other known public-key systems at equivalent security level. The key size advantage of ECC provides faster computations, less memory consumption, less processing power and efficient bandwidth usage. These properties make ECC attractive especially for the next generation public-key cryptosystems. The implementation of ECC involves so many arithmetic operations; one of them is the ellipt...
Error Control of MLFMA within a Multiple-Precision Arithmetic Framework Kalfa, Mert; ERTÜRK, VAKUR BEHÇET; Ergül, Özgür Salih (2018-07-13) We present a new error control scheme that provides the truncation numbers as well as the required digits of machine precision for the multilevel fast multipole algorithm (MLFMA). The proposed method is valid for all frequencies, whereas the previous studies on error control are valid only for high-frequency problems. When combined with a multiple-precision arithmetic framework, the proposed method can be used to solve low-frequency problems that would otherwise experience overflow issues. Numerical results...
Bit-Wise Unequal Error Protection for Variable-Length Block Codes With Feedback Nakiboğlu, Barış; Zheng, Lizhong; Coleman, Todd P (2013-03-01) The bit-wise unequal error protection problem, for the case when the number of groups of bits is fixed, is considered for variable-length block codes with feedback. An encoding scheme based on fixed-length block codes with erasures is used to establish inner bounds to the achievable performance for finite expected decoding time. A new technique for bounding the performance of variable-length block codes is used to establish outer bounds to the performance for a given expected decoding time. The inner and th...

Citation Formats

İ. H. Toroslu, “Mining cyclically repeated patterns,” 2001, vol. 2114, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/56488.