Automatic retrieval of network hotspot information based on improved DBSCAN clustering algorithm

With the continuous development of the Internet in the world today, the proliferation of network information makes it difficult for people to effectively screen out current hotspot information. In order to solve the problem of how to retrieve the current hot information quickly and accurately under...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of physics. Conference series Ročník 1570; číslo 1; s. 12004 - 12009
Hlavní autor: Deng, Dingsheng
Médium: Journal Article
Jazyk:angličtina
Vydáno: Bristol IOP Publishing 01.06.2020
Témata:
ISSN:1742-6588, 1742-6596
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:With the continuous development of the Internet in the world today, the proliferation of network information makes it difficult for people to effectively screen out current hotspot information. In order to solve the problem of how to retrieve the current hot information quickly and accurately under the massive network information, an automatic network information retrieval method based on the improved DBSCAN clustering algorithm is proposed. The retrieved related keywords are combined to reduce the feature terms, which effectively solves the problem of repeated acquisition of public resource object neighbourhoods, greatly improves the accuracy and efficiency of the clustering algorithm, and realizes automatic retrieval of network information hot spots. The results show that the automatic network information retrieval method based on the improved DBSCAN clustering algorithm proposed in this paper can quickly and accurately find the current information hotspots on the Internet, help users to obtain the hotspot information of their own most interest, and promote the progress and development of the Internet.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1570/1/012004