Show simple item record

dc.contributor.advisorAcuña Fernández, Edgar
dc.contributor.authorLozano Inca, Elio
dc.date.accessioned2019-02-12T15:30:47Z
dc.date.available2019-02-12T15:30:47Z
dc.date.issued2006
dc.identifier.urihttps://hdl.handle.net/20.500.11801/1798
dc.description.abstractRecently databases are increasing continuously without bound, due to new data acquisition technologies. One challenge is how to gain knowledge from these large data sets. In this thesis, we analyze and improve the algorithmic solution of four problems related to knowledge discovery and data mining, making use of parallel computing; we also compare our results with related works. We design two parallel algorithms for outlier detection; the first one is for finding distance-based outliers based on nested loops along with randomization and the use of a pruning rule. The second parallel algorithm is for detecting density-based local outliers. In both cases data parallelism is used. The star coordinates plot is a useful visualization technique, but it has some drawbacks. We enhance the traditional star coordinates plot introducing new parameters that will allow us to visualize the data points in two dimensions as polygons and in three dimensions as polyhedrons. In order to visualize large data sets and reduce its computational time, a parallel algorithm is also designed. We design a new meta-classifier algorithm, and its performance is compared with base classifier algorithms and Bagged based meta-classifier algorithms. Our meta-classifier algorithm gives better results compared to other meta-classifier algorithms. For speeding up its computation time as well as making it suitable for large data sets a parallel algorithm is developed. We develop a meta-clustering algorithm and compare its performance with two Bagged based meta-clustering algorithms, and hypergraph partitioning meta-clustering algorithm. Our proposed meta-clustering algorithm gives results close to the best clustering algorithm, and is more robust to the data dependency problem. A parallel algorithm to compute four meta-clustering algorithm is also designed. The experimental results of our collection of sequential and parallel programs is tested in two different clusters of Linux-based workstations using real-world databases available in the Machine Learning Repository of the University of California at Irvine.en_US
dc.description.sponsorshipThe Office of Naval Research (ONR) provided the grant number. N00014-03-1-0359.en_US
dc.language.isoEnglishen_US
dc.subjectParallel and distributed computingen_US
dc.subjectData miningen_US
dc.titleContributions to parallel and distributed computing in knowledge discovery and data mining en_US
dc.typeDissertationen_US
dc.rights.licenseAll rights reserveden_US
dc.rights.holder(c) 2006 Elio Lozano Incaen_US
dc.contributor.committeeBollman, Dorothy
dc.contributor.committeeAcar, Robert
dc.contributor.committeeVega, Jose Fernando
dc.contributor.representativeCastellanos, Dorial
thesis.degree.levelPh.D.en_US
thesis.degree.disciplineComputing and Information Sciences and Engineeringen_US
dc.contributor.collegeCollege of Engineeringen_US
dc.contributor.departmentDepartment of Electrical and Computer Engineeringen_US
dc.description.graduationSemesterFallen_US
dc.description.graduationYear2006en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

  • Theses & Dissertations
    Items included under this collection are theses, dissertations, and project reports submitted as a requirement for completing a degree at UPR-Mayagüez.

Show simple item record

All rights reserved
Except where otherwise noted, this item's license is described as All Rights Reserved