Show simple item record

dc.contributor.authorKumar, Deepten
dc.date.accessioned2014-03-14T20:11:29Zen
dc.date.available2014-03-14T20:11:29Zen
dc.date.issued2007-04-19en
dc.identifier.otheretd-05032007-223232en
dc.identifier.urihttp://hdl.handle.net/10919/27518en
dc.description.abstractScientific data mining purports to extract useful knowledge from massive datasets curated through computational science efforts, e.g., in bioinformatics, cosmology, geographic sciences, and computational chemistry. In the recent past, we have witnessed major transformations of these applied sciences into data-driven endeavors. In particular, scientists are now faced with an overload of vocabularies for describing domain entities. All of these vocabularies offer alternative and mostly complementary (sometimes, even contradictory) ways to organize information and each vocabulary provides a different perspective into the problem being studied. To further knowledge discovery, computational scientists need tools to help uniformly reason across vocabularies, integrate multiple forms of characterizing datasets, and situate knowledge gained from one study in terms of others. This dissertation defines a new pattern class called redescriptions that provides high level capabilities for reasoning across domain vocabularies. A redescription is a shift of vocabulary, or a different way of communicating the same information; redescription mining finds concerted sets of objects that can be defined in (at least) two ways using given descriptors. We present the CARTwheels algorithm for mining redescriptions by exploiting equivalences of partitions induced by distinct descriptor classes as well as applications of CARTwheels to several bioinformatics datasets. We then outline how we can build more complex data mining operations by cascading redescriptions to realize a story, leading to a new data mining capability called storytelling. Besides applications to characterizing gene sets, we showcase its uses in other datasets as well. Finally, we extend the core CARTwheels algorithm by introducing a theoretical framework, based on partitions, to systematically explore redescription space; generalizing from mining redescriptions (and stories) within a single domain to relating descriptors across different domains, to support complex relational data mining scenarios; and exploiting structure of the underlying descriptor space to yield more effective algorithms for specific classes of datasets.en
dc.publisherVirginia Techen
dc.relation.haspartdeept_redescs.pdfen
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subjectbioinformaticsen
dc.subjectstorytellingen
dc.subjectredescription miningen
dc.subjectredescriptionsen
dc.titleRedescription Mining: Algorithms and Applications in Bioinformaticsen
dc.typeDissertationen
dc.contributor.departmentComputer Scienceen
dc.description.degreePh. D.en
thesis.degree.namePh. D.en
thesis.degree.leveldoctoralen
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen
thesis.degree.disciplineComputer Scienceen
dc.contributor.committeechairRamakrishnan, Narenen
dc.contributor.committeememberNorth, Christopher L.en
dc.contributor.committeememberMurali, T. M.en
dc.contributor.committeememberPotts, Malcolmen
dc.contributor.committeememberHelm, Richard Fredericken
dc.identifier.sourceurlhttp://scholar.lib.vt.edu/theses/available/etd-05032007-223232/en
dc.date.sdate2007-05-03en
dc.date.rdate2007-05-10en
dc.date.adate2007-05-10en


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record