Date of Award

12-31-2013

Document Type

Campus Access Dissertation

Degree Name

Doctor of Philosophy (PhD)

Department

Computer Science

First Advisor

Dan A. Simovici

Second Advisor

Wei Ding

Third Advisor

Nurit Haspel

Abstract

Data mining is used in many areas of science and engineering, such as bioinformatics, genetics, finance and electrical engineering. The increased used of data mining brings a lot of new techniques, but with the cost of complexity and specialized problems. In electrical engineering, automated design of circuits is challenging due to the growing scale and complexities of the circuits. Data mining techniques improve the existing solutions, allowing circuit design to be fully automated or with minimal human intervention. Our contribution consists of a method that detects the minimal sets of variables that determine the values of a discrete partially defined function, and in a novel method of decomposition of partially specified index generation functions (PSIGFs). The data mining process can be costly. Therefore, it is important to evaluate the potential payoff of the mining process before the actual mining takes place. We propose a new approach for evaluating the minability of data sets by using compression. The basic idea is that compressible data contains patterns and the existence of these patterns makes the data worth mining.

Comments

Free and open access to this Campus Access Dissertation is made available to the UMass Boston community by ScholarWorks at UMass Boston. Those not on campus and those without a Healey Library (UMass Boston) barcode may gain access to this dissertation through resources like Proquest Dissertations & Theses Global. If you have a Healey Library barcode and would like to download this work from off-campus, click on the "Off-Campus UMass Boston Users" link above.

Share

COinS