Abstract
Facing to huge network text data, how to analyze Internet news reports timely and effectively is more and more concerned. A fast hierarchical topic detection method is proposed with following two improvements. On the one hand, based on the traditional topic detection method of K-means, the new method improves the detection process by using a new parameter of news’s contribution for topics to have better adaptability of hierarchical topics. The experimental results also present that this new method has better detection performance, especially for those hierarchical topics. On the other hand, based on the above-mentioned method, an improved hierarchical clustering algorithm is further explored. The result demonstrates that different aspects of hierarchical topics could be fully described with low time processing complexity.
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.
