Mining interesting itemsets
Data mining aims to discover knowledge in large databases. The desired knowledge, normally represented as patterns, are deemed interesting if they benefit some applications. Therefore, the objective of data mining can be translated to finding interesting patterns from observational data. In this the...
Saved in:
Main Author: | |
---|---|
Other Authors: | |
Format: | Theses and Dissertations |
Language: | English |
Published: |
2011
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/45201 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-45201 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-452012023-03-04T00:47:44Z Mining interesting itemsets Ardian Kristano Poernomo Vivekanand Gopalkrishnan School of Computer Engineering DRNTU::Engineering::Computer science and engineering::Information systems::Database management Data mining aims to discover knowledge in large databases. The desired knowledge, normally represented as patterns, are deemed interesting if they benefit some applications. Therefore, the objective of data mining can be translated to finding interesting patterns from observational data. In this thesis, we focus on the simplest form of patterns, which is a set of features (items), also called an itemset. In a high level, data mining process can be split into three parts. The first is to define the notion of interesting patterns. The solution of this subtask is highly application and domain dependent. Having the mathematical formulation of interesting patterns, the next subtask is to find/enumerate those interesting patterns. As the number of interesting patterns are usually too much, the last subtask is to present those patterns in an interpretable and concise form. DOCTOR OF PHILOSOPHY (SCE) 2011-06-10T01:06:59Z 2011-06-10T01:06:59Z 2011 2011 Thesis Ardian, K. P. (2011). Mining interesting itemsets. Doctoral thesis, Nanyang Technological University, Singapore. https://hdl.handle.net/10356/45201 10.32657/10356/45201 en 217 p. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NTU Library |
collection |
DR-NTU |
language |
English |
topic |
DRNTU::Engineering::Computer science and engineering::Information systems::Database management |
spellingShingle |
DRNTU::Engineering::Computer science and engineering::Information systems::Database management Ardian Kristano Poernomo Mining interesting itemsets |
description |
Data mining aims to discover knowledge in large databases. The desired knowledge, normally represented as patterns, are deemed interesting if they benefit some applications. Therefore, the objective of data mining can be translated to finding interesting patterns from observational data. In this thesis, we focus on the simplest form of patterns, which is a set of features (items), also called an itemset. In a high level, data mining process can be split into three parts. The first is to define the notion of interesting patterns. The solution of this subtask is highly application and domain dependent. Having the mathematical formulation of interesting patterns, the next subtask is to find/enumerate those interesting patterns. As the number of interesting patterns are usually too much, the last subtask is to present those patterns in an interpretable and concise form. |
author2 |
Vivekanand Gopalkrishnan |
author_facet |
Vivekanand Gopalkrishnan Ardian Kristano Poernomo |
format |
Theses and Dissertations |
author |
Ardian Kristano Poernomo |
author_sort |
Ardian Kristano Poernomo |
title |
Mining interesting itemsets |
title_short |
Mining interesting itemsets |
title_full |
Mining interesting itemsets |
title_fullStr |
Mining interesting itemsets |
title_full_unstemmed |
Mining interesting itemsets |
title_sort |
mining interesting itemsets |
publishDate |
2011 |
url |
https://hdl.handle.net/10356/45201 |
_version_ |
1759855238851854336 |