Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1957/6226
Full metadata record
DC FieldValueLanguage
dc.contributorBudd, Timothy-
dc.contributorWong, Weng-Keen-
dc.contributorZhang, Eugene-
dc.contributorScott, Michael-
dc.date2007-07-31T16:07:03Z-
dc.date2007-07-31T16:07:03Z-
dc.date2007-06-15-
dc.date2007-07-31T16:07:03Z-
dc.date.accessioned2013-10-16T08:04:35Z-
dc.date.available2013-10-16T08:04:35Z-
dc.date.issued2013-10-16-
dc.identifierhttp://hdl.handle.net/1957/6226-
dc.identifier.urihttp://koha.mediu.edu.my:8181/xmlui/handle/1957/6226-
dc.descriptionGraduation date: 2008-
dc.descriptionA basic tradeoff to consider when designing a distributed data-mining framework is the need for a compromise between the cost of communication and computation resources and the accuracy of the mining results. This is essentially a decision of whether it is more efficient to communicate all of the data to a central site for analysis, possibly increasing the accuracy of the results, or is it more efficient to mine the data locally at each of the remote sites and then combine the results, possibly reducing the use of communication and computation resources. This research attempts the design, analysis, and implementation of an efficient distributed and cumulative learning algorithm with performance guarantees that are provable relative to its centralized or batch counterparts for knowledge acquisition from distributed data sources that will address this tradeoff. This thesis also develops a methodical mathematical framework to describe this type of tradeoff, describes the reduction of the problem to a constrained optimization problem, and demonstrates techniques to balance cost and accuracy levels.-
dc.languageen_US-
dc.subjectdata mining-
dc.subjectconstrained optimization-
dc.titleAccuracy versus cost in distributed data mining-
dc.typeThesis-
Appears in Collections:ScholarsArchive@OSU

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.