- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Theses and Dissertations /
- Visual mining of powersets with large alphabets
Open Collections
UBC Theses and Dissertations
UBC Theses and Dissertations
Visual mining of powersets with large alphabets Kong, Qiang
Abstract
We present the PowerSetViewer visualization system for lattice-based mining of powersets. Searching for items within the powerset of a universe occurs in many large dataset knowledge discovery contexts. Using a spatial layout based on a powerset provides a unified visual framework at three different levels: data mining on the filtered dataset, browsing the entire dataset, and comparing multiple datasets sharing the same alphabet. The features of our system allow users to find appropriate parameter settings for data mining algorithms through lightweight visual experimentation showing partial results. We use dynamic constrained frequent-set mining as a concrete case study to showcase the utility of the system. The key challenge for spatial layouts based on powerset structure is in handling large alphabets, since the size of the powerset grows exponentially with the size of the alphabet. We present scalable algorithms for enumerating and displaying datasets containing between 1.5 and 7 million itemsets, and alphabet sizes of over 40,000.
Item Metadata
Title |
Visual mining of powersets with large alphabets
|
Creator | |
Publisher |
University of British Columbia
|
Date Issued |
2006
|
Description |
We present the PowerSetViewer visualization system for lattice-based mining
of powersets. Searching for items within the powerset of a universe
occurs in many large dataset knowledge discovery contexts. Using a spatial
layout based on a powerset provides a unified visual framework at three
different levels: data mining on the filtered dataset, browsing the entire
dataset, and comparing multiple datasets sharing the same alphabet. The
features of our system allow users to find appropriate parameter settings for
data mining algorithms through lightweight visual experimentation showing
partial results. We use dynamic constrained frequent-set mining as a concrete
case study to showcase the utility of the system. The key challenge
for spatial layouts based on powerset structure is in handling large alphabets,
since the size of the powerset grows exponentially with the size of the
alphabet. We present scalable algorithms for enumerating and displaying
datasets containing between 1.5 and 7 million itemsets, and alphabet sizes
of over 40,000.
|
Genre | |
Type | |
Language |
eng
|
Date Available |
2010-01-06
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.
|
DOI |
10.14288/1.0051718
|
URI | |
Degree | |
Program | |
Affiliation | |
Degree Grantor |
University of British Columbia
|
Graduation Date |
2006-05
|
Campus | |
Scholarly Level |
Graduate
|
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.