Repository logo
Log In(current)
  1. Home
  2. Colleges & Schools
  3. Graduate School
  4. Masters Theses
  5. Data mining over mismatched domains
Details

Data mining over mismatched domains

Date Issued
December 1, 1997
Author(s)
Ary, Bryan Keith
Advisor(s)
Bruce Whitehead
Additional Advisor(s)
Kenneth Kimble, Dinesh Mehta
Abstract

Data mining is the discovery of non-obvious knowledge about a large set of related data. Pattern matching is one data mining technique often used to find nonobvious relationships and associations between data items. The problem addressed by this research is the reconciliation of two data sets of different origin that contain information about the same real-world entities. This research compares the effectiveness of the back-propagation neural network model and the least-squares multiple linear regression model by using each method to recognize when a record in one data set describes the same real-world entity as a record in the other data set. Results of this research indicate that back-propagation can easily over-fit mismatched data but does outperform least-squares approximations when the number of hidden layer neurons is carefully chosen.

Degree
Master of Science
Major
Computer Science
File(s)
Thumbnail Image
Name

Thesis97.A85.pdf_AWSAccessKeyId_AKIAYVUS7KB2IXSYB4XB_Signature_4ThVz_2B6QUqL5CxQkZ_2FEnXZhfU_2BY_3D_Expires_1711729396

Size

3.65 MB

Format

Unknown

Checksum (MD5)

843e354980a476494c5b55ee5b43fb3d

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Privacy policy
  • End User Agreement
  • Send Feedback
  • Contact
  • Libraries at University of Tennessee, Knoxville
Repository logo COAR Notify