Abstract
With enormous development of digital technology, data is being generated at rapid rate with various application domains. Data has to be extracted or filtered to find useful information. A basic concept for these tasks and applications are the distance measures to effectively determine how similar two objects are. In this paper, a novel similarity measure for clustering text documents is proposed using the cardinality of the terms in the documents. The bench mark algorithm k-medoids is used for clustering task. The results obtained from the proposed distance measure are compared with other standard distance measures like Manhattan, Euclidean distance measure. Dunn Index is used to analyze the cluster validation of the results obtained from the distance measure.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IOP Conference Series: Materials Science and Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
