| Title |
Statistinis dažnų posekių paieškos algoritmas / |
| Translation of Title |
Statistical algorithm for mining frequent sequences. |
| Authors |
Savulionienė, Loreta ; Sakalauskas, Leonidas |
| DOI |
10.15388/Im.2011.0.3118 |
| Full Text |
|
| Is Part of |
Informacijos mokslai / Vilniaus universitetas.. Vilnius : Vilniaus universiteto leidykla. 2011, t. 58, p. 126-143.. ISSN 1392-0561 |
| Abstract [eng] |
Modern life involves large amounts of data and information. Search is one of the major operations performed by a computer. Search goal is to find a sequence (element) in large amounts of data or to confirm that it does not exist. Amounts of data in databases have reached terabytes, and therefore data retrieval, analysis, rapid decision-making become increasingly complicated. Large quantities of information cover both important and void information. The main goal of data mining is to find the meaning in data, i.e. a relationship between the data, their reproducibility, etc. This technology applies to business, medicine and other areas where large amounts of information are processed and a relationship among data is detected, i.e. new information is obtained from large amounts of data. The paper proposes a new statistic algorithm for repeated sequence search. The essence of this statistic algorithm is to identify repeated sequences quickly. During the algorithm all contents of the file are not checked several times. During the algorithm, the file is checked once according to the chosen probability p. This algorithm is inaccurate, but its execution time is shorter than of the accurate algorithms. |
| Published |
Vilnius : Vilniaus universiteto leidykla |
| Type |
Journal article |
| Language |
Lithuanian |
| Publication date |
2011 |
