基于K最近鄰算法的網(wǎng)絡(luò)不良信息過濾系統(tǒng)研究

湯烈 穆合義 候愛蓮 鄢喜愛

摘? ?要：網(wǎng)絡(luò)不良信息過濾的難點是如何對信息進(jìn)行準(zhǔn)確分類，而K最近鄰分類器作為模式分類領(lǐng)域一種簡單而有效的分類方法，在很多領(lǐng)域得到應(yīng)用。提出了一種基于K最近鄰算法的網(wǎng)絡(luò)不良信息過濾方法，并對K最近鄰算法計算量大的問題進(jìn)行了一些改進(jìn)。實驗表明：采用K最近鄰算法的不良信息過濾系統(tǒng)具有良好的應(yīng)用效果。

關(guān)鍵詞：K最近鄰;不良信息;過濾;樣本優(yōu)化

中圖分類號：TP39? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? 文獻(xiàn)標(biāo)識碼：A

Research on Network Bad Information Filtering System Based

on K Nearest Neighbor Algorithms

TANG Lie1？覮，MU He-yi1，HOU Ai-lian2，YAN Xi-ai2

（1.Public Security Department of Hunan Province，Changsha，Hunan 410001，China;

2. Changsha Branch，The People′s Bank of? China，Changsha，Hunan 410005，China;

3. Hunan Police Academy，Changsha，Hunan 410138，China）

Absrtact：The difficulty of bad information filtering is how to classify information accurately. K-nearest neighbor classifier，as a simple and effective classification method in the field of pattern classification，has been applied in many fields. A method of filtering bad information in network based on K-nearest neighbor algorithm is proposed，and some improvements are made on the problem of large computation of K-nearest neighbor algorithm. Experiments show that the bad information filtering system using K-nearest neighbor algorithm has good application effect.

Key words：K nearest neighbor;bad information;filtering;sample optimization