IDEAS home Printed from https://ideas.repec.org/a/bla/jamest/v35y1984i5p268-276.html
   My bibliography  Save this article

Two partitioning type clustering algorithms

Author

Listed:
  • Fazli Can
  • Esen A. Ozkarahan

Abstract

In this article, two partitioning type clustering algorithms are presented. Both algorithms use the same method for selecting cluster seeds; however, assignment of documents to the seeds is different. The first algorithm uses a new concept called “cover coefficient,” and it is a single‐pass algorithm. The second one uses a conventional measure for document assignment to the cluster seeds and is a multipass algorithm. The concept of clustering, a model for seed oriented partitioning, the new centroid generation approach, and an illustration for both algorithms are also presented in the article.

Suggested Citation

  • Fazli Can & Esen A. Ozkarahan, 1984. "Two partitioning type clustering algorithms," Journal of the American Society for Information Science, Association for Information Science & Technology, vol. 35(5), pages 268-276, September.
    • Handle: RePEc:bla:jamest:v:35:y:1984:i:5:p:268-276
    DOI: 10.1002/asi.4630350503
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/asi.4630350503
    Download Restriction: no
    File URL: https://libkey.io/10.1002/asi.4630350503?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:jamest:v:35:y:1984:i:5:p:268-276. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://www.asis.org .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.