Mining partially ordered sequential rules on unbounded data
| dc.contributor.advisor | Buffett, Scott | |
| dc.contributor.advisor | Fleming, Michael | |
| dc.contributor.author | Drozdyuk, Andriy | |
| dc.date.accessioned | 2023-03-01T16:23:33Z | |
| dc.date.available | 2023-03-01T16:23:33Z | |
| dc.date.issued | 2018 | |
| dc.date.updated | 2023-03-01T15:02:02Z | |
| dc.description.abstract | Data mining studies how to separate useful data from the rest. Recent work in the field of Sequential Rule Mining has led to mining new types of rules, partially ordered sequential rules. However, existing approaches do not consider the case of unbounded data. With unbounded data, conventional approaches to data mining are not sufficient because they become slow as the dataset increases in size. We propose an algorithm that makes use of previous intelligence when processing new information. This requires a slight reformulation of the problem and the solution. In the end, we show that our algorithm, on average, outperforms the existing approaches when applied to unbounded data. | |
| dc.description.copyright | ©Andriy Drozdyuk, 2018 | |
| dc.format | text/xml | |
| dc.format.extent | viii, 112 pages | |
| dc.format.medium | electronic | |
| dc.identifier.uri | https://unbscholar.lib.unb.ca/handle/1882/13722 | |
| dc.language.iso | en_CA | |
| dc.publisher | University of New Brunswick | |
| dc.rights | http://purl.org/coar/access_right/c_abf2 | |
| dc.subject.discipline | Computer Science | |
| dc.title | Mining partially ordered sequential rules on unbounded data | |
| dc.type | master thesis | |
| thesis.degree.discipline | Computer Science | |
| thesis.degree.fullname | Master of Computer Science | |
| thesis.degree.grantor | University of New Brunswick | |
| thesis.degree.level | masters | |
| thesis.degree.name | M.C.S. |
Files
Original bundle
1 - 1 of 1