{"id":657,"date":"2018-05-31T08:19:27","date_gmt":"2018-05-31T08:19:27","guid":{"rendered":"http:\/\/www.labren.org\/mm\/?p=657"},"modified":"2018-05-31T08:19:27","modified_gmt":"2018-05-31T08:19:27","slug":"kernel-neighbor-density-with-parallel-computing-mechanism-for-anomaly-detection-algorithm","status":"publish","type":"post","link":"http:\/\/www.labren.org\/mm\/publications\/kernel-neighbor-density-with-parallel-computing-mechanism-for-anomaly-detection-algorithm\/","title":{"rendered":"Kernel neighbor density with parallel computing mechanism for anomaly detection algorithm"},"content":{"rendered":"<h2>Abstract<\/h2>\n<p>Anomaly detection is an important research direction in the \ufb01eld of data mining and industrial dataset preprocess. The paper proposed a kernel neighbor densityde\ufb01nition with parallel computing mechanism for anomaly detection algorithm. The kernel neighbor density formula calculates the density of points in high dimensional space. In our de\ufb01nition, we adopt the median operation because the breakdown point of the median is the largest possible. So thede\ufb01nition could be a very robust estimate of the data location, and parallel computing mechanism is introduced to improve the ef\ufb01ciency of algorithms. We use two real datasets and three different kernel functions to evaluate the performance of algorithms. The experiment results con\ufb01rm that the presentedde\ufb01nition of kernel neighbor density improves the performance of algorithms and the Gaussian kernel function has the best effect <\/p>\n<p><a href=\"https:\/\/www.researchgate.net\/publication\/308866960_Kernel_neighbor_density_with_parallel_computing_mechanism_for_anomaly_detection_algorithm\">full text<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Abstract Anomaly detection is an important research direction in the \ufb01eld of data mining and industrial dataset preprocess. The paper proposed a kernel neighbor densityde\ufb01nition with parallel computing mechanism for anomaly detection algorithm. The kernel neighbor density formula calculates the density of points in high dimensional space. In our de\ufb01nition,\u2026 <a class=\"continue-reading-link\" href=\"http:\/\/www.labren.org\/mm\/publications\/kernel-neighbor-density-with-parallel-computing-mechanism-for-anomaly-detection-algorithm\/\">Continue reading<\/a><\/p>\n","protected":false},"author":13,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"ngg_post_thumbnail":0,"footnotes":""},"categories":[12],"tags":[],"class_list":["post-657","post","type-post","status-publish","format-standard","hentry","category-publications"],"_links":{"self":[{"href":"http:\/\/www.labren.org\/mm\/wp-json\/wp\/v2\/posts\/657","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/www.labren.org\/mm\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/www.labren.org\/mm\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/www.labren.org\/mm\/wp-json\/wp\/v2\/users\/13"}],"replies":[{"embeddable":true,"href":"http:\/\/www.labren.org\/mm\/wp-json\/wp\/v2\/comments?post=657"}],"version-history":[{"count":1,"href":"http:\/\/www.labren.org\/mm\/wp-json\/wp\/v2\/posts\/657\/revisions"}],"predecessor-version":[{"id":663,"href":"http:\/\/www.labren.org\/mm\/wp-json\/wp\/v2\/posts\/657\/revisions\/663"}],"wp:attachment":[{"href":"http:\/\/www.labren.org\/mm\/wp-json\/wp\/v2\/media?parent=657"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/www.labren.org\/mm\/wp-json\/wp\/v2\/categories?post=657"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/www.labren.org\/mm\/wp-json\/wp\/v2\/tags?post=657"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}