Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mark Shavlik

dblp:40/6047 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2004
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Network security · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network security › intrusion detection and prevention › intrusion detection
anomaly detection
0.012004
Selection, combination, and evaluation of effective software sensors for detecting abnormal computer usage · KDD 2004
Network security › intrusion detection and prevention › intrusion detection › intrusion detection system
host-based intrusion detection
0.012004
Selection, combination, and evaluation of effective software sensors for detecting abnormal computer usage · KDD 2004
Network security › intrusion detection and prevention
intrusion detection
0.012004
Selection, combination, and evaluation of effective software sensors for detecting abnormal computer usage · KDD 2004
Data mining › dimensionality reduction
feature selection
0.012004
Selection, combination, and evaluation of effective software sensors for detecting abnormal computer usage · KDD 2004

Methods — techniques the papers use, named apart from their topics

winnow algorithm · 0.1machine learning · 0.1
YearPublicationVenuePosition
2004 Selection, combination, and evaluation of effective software sensors for detecting abnormal computer usage
abstract
We present and empirically analyze a machine-learning approach for detecting intrusions on individual computers. Our Winnow-based algorithm continually monitors user and system behavior, recording such properties as the number of bytes transferred over the last 10 seconds, the programs that currently are running, and the load on the CPU. In all, hundreds of measurements are made and analyzed each second. Using this data, our algorithm creates a model that represents each particular computer's range of normal behavior. Parameters that determine when an alarm should be raised, due to abnormal activity, are set on a per-computer basis, based on an analysis of training data. A major issue in intrusion-detection systems is the need for very low false-alarm rates. Our empirical results suggest that it is possible to obtain high intrusion-detection rates (95%) and low false-alarm rates (less than one per day per computer), without "stealing" too many CPU cycles (less than 1%). We also report which system measurements are the most valuable in terms of detecting intrusions. A surprisingly large number of different measurements prove significantly useful.
Jude W. Shavlik, Mark Shavlik
KDD2