Search
Now showing items 11-15 of 15
Node Re-Usability in Structured Hypertext Systems
(1992-08-01)
When the size of a graph-based hyperdocument exceeds a certain limit, the graph structure gets complicated and causes navigation and document management problems. A simple solution for this problem is the structuring ofthe ...
Experiments on Incremental Clustering
(1991-08-01)
Clustering of very large document databases is essential to reduce the spacehime complexity of information retrieval. The periodic updating of clusters is required due to the dynamic nature of databases. An algorithm for ...
Implementation of an Information Retrieval System (ANIRS) with Ranking and Browsing Capabilities
(1992-04-01)
This report describes an implementation of a cluster based
information retrieval system with statistical ranking facilities, ANIRS. ANIRS uses the vector space model to represent the document database. In this model, the ...
Effectiveness Assessment of the Cover Coefficient Based Clustering Methodology
An algorithm for document clustering is introduced. The basic concept of the algorithm, Cover Coefficient (CC) concept, provides means of estimating the number of clusters within a document database and relates indexing ...
A Detailed Stylometric Investigation of the İnce Memed Tetralogy*
We analyze four İnce Memed novels of Yaşar Kemal using six style markers: “most frequent words,” “syllable counts,” “word type -or part of speech- information,” “sentence length in terms of words,” “word length in text,” ...