Scholarly Commons at Miami University Scholarly Commons @ MU
    • Login
    • Scholarly Commons FAQs
    • SHERPA/RoMEO
    • SPARC Author Addendum Engine
    View Item 
    •   SC Home
    • Faculty Research and Scholarship
    • College of Engineering and Computing
    • Computer Science and Software Engineering
    • Computer Science and Software Engineering Technical Reports
    • View Item
    •   SC Home
    • Faculty Research and Scholarship
    • College of Engineering and Computing
    • Computer Science and Software Engineering
    • Computer Science and Software Engineering Technical Reports
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Experiments on Incremental Clustering

    Thumbnail
    View/Open
    fulltext.pdf (2.046Mb)
    Date
    1991-08-01
    Author
    Can, Fazli
    Metadata
    Show full item record
    Abstract
    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 incremental clustering at discrete times is introduced, Its complexity and cost analysis and an investigation of the expected behavior of the algorithm are provided. Through empirical testing, it is shown that the algorithm is achieving its purpose in terms of being cost effective, generating statistically valid clusters that are compatible with those of reclustering, and providing effective information retrieval.
    URI

    http://hdl.handle.net/2374.MIA/187
    Collections
    • Computer Science and Software Engineering Technical Reports

    Browse

    All of Scholarly CommonsCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    Statistics

    View Usage Statistics

    - Miami University Libraries
    - Center for Digital Scholarship
    - Contact Us
    DSpace software
    Mirage 2 Theme
    htmlmap