Show simple item record

dc.contributor.authorLakkaraju, Praveen
dc.date.accessioned2021-10-08T19:14:28Z
dc.date.available2021-10-08T19:14:28Z
dc.date.issued2007-05-31
dc.identifier.urihttp://hdl.handle.net/1808/32041
dc.descriptionThesis (M.S.)--University of Kansas, Electrical Engineering and Computer Science, 2007.en_US
dc.description.abstractThe Web is fast moving from an era of search engines to an era of discovery engines. Discovery engines help you find things that you never knew existed or did not know how to ask for. One of the ways this can be done is by automatically computing and displaying objects that are similar to the object in which the user is currently expressing interest. In this paper, we present a new approach to compute interdocument similarity that is based on a tree-matching algorithm. We represent each document as a concept tree using the concept associations obtained from a classifier. We make use of a tree-matching algorithm called the tree edit distance to compute similarities between these concept trees. Experiments on a subset of documents from the CiteSeer collection showed that our algorithm performed better than the document similarity based on the traditional vector space model.en_US
dc.publisherUniversity of Kansasen_US
dc.rightsThis item is protected by copyright and unless otherwise specified the copyright of this thesis/dissertation is held by the author.en_US
dc.subjectApplied sciencesen_US
dc.titleDocument similarity based on concept tree distanceen_US
dc.typeThesisen_US
dc.thesis.degreeDisciplineElectrical Engineering and Computer Science
dc.thesis.degreeLevelM.S.
kusw.bibid5349267
dc.rights.accessrightsopenAccessen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record