Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 159

The DOI matches its Crossref record.

The Application on Intrusion Detection Based on K-means Cluster Algorithm

Jianliang, Meng, Haikun, Shang, Ling, Bian·2009·2009 International Forum on Information Technology and Applications

Abstract

Internet security has been one of the most important problems in the world. Anomaly detection is the basic method to defend new attack in intrusion detection. Network intrusion detection is the process of monitoring the events occurring in a computing system or network and analyzing them for signs of intrusions, defined as attempts to compromise the confidentiality. A wide variety of data mining techniques have been applied to intrusion detections. In data mining, clustering is the most important unsupervised learning process used to find the structures or patterns in a collection of unlabeled data. We use the K-means algorithm to cluster and analyze the data in this paper. Computer simulations show that this method can detect unknown intrusions efficiently in the real network connections.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/ifita.2009.34

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 159

Metadata

Authors
Jianliang, M., Haikun, S., & Ling, B.
Venue
2009 International Forum on Information Technology and Applications
Publisher
IEEE
Published
2009-05
Pages
150-152
OpenAlex
W2147457514
Cited by
159
References
0
FWCI
4.05
Type
conference paper
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: The Application on Intrusion Detection Based on K-means Cluster Algorithm. https://app.cochat.ai/papers/10.1109/ifita.2009.34
The paper
Jianliang, M., Haikun, S., & Ling, B. (2009). The Application on Intrusion Detection Based on K-means Cluster Algorithm. 2009 International Forum on Information Technology and Applications. https://doi.org/10.1109/ifita.2009.34

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.