Abstract
dc:description.abstractThe goal of this research was to determine if the results of a simple comparison algorithm (SCA) could be improved by adding a hyperspace analogue to language model of memory (HAL) layer to form NCA. The HAL layer provides contextual data that otherwise would be unavailable for consideration. It was found that NCA did improve the results when compared to SCA alone. However, NCA added complexity problems that limit its practicality. The complexity of this algorithm is On3 where n is equal to the number of unique symbols in the data. While there is a relativity reasonable soft upper bound for the number of unique symbols used in a language, the complexity still limits the uses of the NCA combined algorithm. The conclusion from this research is that NCA can improve results. This research also suggested that the quality of results might increase as more data is processed by NCA.
Degree
thesis:*- Name thesis:degree_name
- Master of Science
- Level thesis:degree_level
- Thesis
- Discipline thesis:degree_discipline
- Computer Science
- Year dc:date.available
- 2005
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Finegan, Edward Graham
- Contributors dc:contributor
-
- Dr. David Primeaux
Subjects
dc:subject × 8Rights
dc:rights- Statement dc:rights
-
- © The Author
Identifiers
dc:identifier.*- Identifier
- https://scholarscompass.vcu.edu/etd/1343
- OAI identifier oai:identifier
- oai:scholarscompass.vcu.edu:etd-2342