Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Efficient database management based on complex association rules
Mid Sweden University, Faculty of Science, Technology and Media, Department of Information Systems and Technology.
2017 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

The large amount of data accumulated by applications is stored in a database. Because of the large amount, name conflicts or missing values sometimes occur. This prevents certain types of analysis. In this work, we solve the name conflict problem by comparing the similarity of the data, and changing the test data into the form of a given template dataset. Studies on data use many methods to discover knowledge from a given dataset. One popular method is association rules mining, which can find associations between items. This study unifies the incomplete data based on association rules. However, most rules based on traditional association rules mining are item-to-item rules, which is a less than perfect solution to the problem. The data recovery system is based on complex association rules able to find two more types of association rules, prefix pattern-to-item, and suffix pattern-to-item rules. Using complex association rules, several missing values are filled in. In order to find the frequent prefixes and frequent suffixes, this system used FP-tree to reduce the time, cost and redundancy. The segment phrases method can also be used for this system, which is a method based on the viscosity of two words to split a sentence into several phrases. Additionally, methods like data compression and hash map were used to speed up the search.

Place, publisher, year, edition, pages
2017. , p. 52
Keyword [en]
Association rules, word segmentation
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:miun:diva-31917Local ID: DT-V17-A2-008OAI: oai:DiVA.org:miun-31917DiVA, id: diva2:1151228
Subject / course
Computer Engineering DT1
Supervisors
Examiners
Available from: 2017-10-23 Created: 2017-10-23 Last updated: 2017-10-23Bibliographically approved

Open Access in DiVA

fulltext(2038 kB)42 downloads
File information
File name FULLTEXT01.pdfFile size 2038 kBChecksum SHA-512
805e2e863dfa31a6dc7370aaf2a8c4d61b9b63d5ac00517ae5c6a658e3221551a285dcc740ff9deb963f26fe0e838205aa871ceac89272657c4f0a26bac1b8d6
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Zhang, Heng
By organisation
Department of Information Systems and Technology
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 42 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 50 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf