Dòng Nội dung
1
A reformed K-Nearest neighbors algorithm for big data sets / Vo Ngoc Phu, Vo Thi Ngoc Tran // Journal of Computer Science. - . - Vol. 14, Issue 9, P.1213-1225. - ISSN:

New York : Science Publications, 2018
13 p.
Ký hiệu phân loại (DDC): 004
A Data Mining Has Already Had Many Algorithms Which A K-Nearest Neighbors Algorithm, K-NN, Is A Famous Algorithm For Researchers. K-NN Is Very Effective On Small Data Sets, However It Takes A Lot Of Time To Run On Big Datasets. Today, Data Sets Often Have Millions Of Data Records, Hence, It Is Difficult To Implement K-NN On Big Data. In This Research, We Propose An Improvement To K-NN To Process Big Datasets In A Shortened Execution Time. The Reformed K-Nearest Neighbors Algorithm (R-K-NN) Can Be Implemented On Large Datasets With Millions Or Even Billions Of Data Records. R-K-NN Is Tested On A Data Set With 500,000 Records. The Execution Time Of R-K-NN Is Much Shorter Than That Of K-NN. In Addition, R-K-NN Is Implemented In A Parallel Network System With Hadoop Map (M) And Hadoop Reduce (R).
 Số bản sách: (0) Tài liệu số: (1)
2
Congestion control algorithm for messagerouting in structured peer - to - peer network / Nguyễn Đình Nghĩa, Nguyễn Hoài Sơn // Tạp chí Tin học và Điều khiển học = Journal of Computer Science And Cybernetics . - 2018. - Page 145 - 159. - ISSN:


15 p.
Ký hiệu phân loại (DDC): 005
ln structured peer-to-peer (P2P) networks. every node must perform message routing to deliver query messages to destination nodes. Therefore they often have to process a large number of query messages quickly and efficiently . When the number of query messages sending to a node exceeds its routing capacity a local congestion on the node occurs and reduces the information processing of the other nodes in the network. This paper proposes a congestion control algorithm for message routing in structured P2P networks by changing the routing table of nodes in the network to route the packet to the destination without going through congested nodes. The performance of the proposed the method has been evaluated and compared with the conventional Chord protocol. The result shows that our proposed method improves the query success rate significantly while minimizing the number of packets generated during congestion control process.
 Số bản sách: (0) Tài liệu số: (0)