Abstract
Social computing services, which enable people to easily communicate and effectively share the information through the Web, are rapidly spreading recently. In such services, recognizing trend topics and analyzing their reputation from user messages have become significant. Effective topic extraction technique from messages in social computing services is needed. However, since messages contain redundancy and topic boundaries are ambiguous, it is difficult to extract appropriate topics. As a first step to extract topics, this paper proposes an effective method to automatic determination of appropriate number of topics based on the intra-cluster distance and the inter cluster-distance among topic clusters We present our experimental results to show the effectiveness of our proposed parameter.
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 callDisclaimer: 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.
