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

Niranjan Mayya

dblp:06/3104 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
1since 2021 · last 2024
0009-0009-2108-6812ORCID · reported

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

Artificial intelligence and machine learning · 2 · 2 first-authorSystems, architecture and hardware · 1Security and privacy · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

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%
Computer networks
1 paper
Network management and operations · 100%

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

TopicWeightPapersLastEvidence papers
Network security › intrusion detection and prevention › intrusion detection › attack detection
advanced persistent threat detection
0.812024
RANK: AI-Assisted End-to-End Architecture for Detecting Persistent Attacks in Enterprise Networks · IEEE Trans. Dependable Secur. Comput. 2024
Network security › intrusion detection and prevention
intrusion detection
0.812024
RANK: AI-Assisted End-to-End Architecture for Detecting Persistent Attacks in Enterprise Networks · IEEE Trans. Dependable Secur. Comput. 2024
Network management and operations › fault management › fault diagnosis
alarm correlation
0.212024
RANK: AI-Assisted End-to-End Architecture for Detecting Persistent Attacks in Enterprise Networks · IEEE Trans. Dependable Secur. Comput. 2024
Geometric modeling and processing
shape representation
0.011994
Voronoi diagrams of polygons: A framework for shape representation · CVPR 1994
Computational geometry
voronoi diagram
0.011994
Voronoi diagrams of polygons: A framework for shape representation · CVPR 1994

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

incident scoring · 1.5graph partitioning · 1.5alert graph construction · 1.5AI-assisted automation · 1.5voronoi diagram construction · 0.0skeletonization · 0.0
YearPublicationVenuePosition
2024 RANK: AI-Assisted End-to-End Architecture for Detecting Persistent Attacks in Enterprise Networks
abstract
Modern government and enterprise networks are the target of sophisticated multi-step attacks called Advanced Persistent Threats (APTs), designed and carried out by expert adversaries. The prolonged nature of APTs results in overwhelming the analyst with an increasingly impractical number of alerts. As a result, the challenge of APT detection is ideal for automation through artificial intelligence (AI). In this paper, we propose the first, up to our knowledge, end-to-end AI-assisted architecture for detecting APTs – RANK. We propose advanced algorithms and solutions for four consecutive sub-problems: 1) alert templating and merging, 2) alert graph construction, 3) alert graph partitioning into incidents, and 4) incident scoring and prioritization. Additionally, we discuss the necessary optimizations and techniques enabling the system to operate in a real-time fashion. We evaluate our architecture against the 2000 DARPA, Mordor, as well as a large number of real-world datasets from enterprise networks. Extensive results are provided showing four orders-of-magnitude reduction in the amount of data to be reviewed, innovative extraction and security-aware scoring of incidents. The extracted incidents can be further used for downstream tasks. In our experiments where we have access to a portion of alert labels, we are able achieve 87% balanced accuracy.
Hazem M. Soliman, Dusan Sovilj, Geoffrey Salmon, Mohan Rao, Niranjan Mayya
IEEE Trans. Dependable Secur. Comput.5
1995 An efficient shape representation scheme using Voronoi skeletons
Niranjan Mayya, V. T. Rajan
Pattern Recognit. Lett.1
1994 Voronoi diagrams of polygons: A framework for shape representation
abstract
This paper describes an efficient shape representation framework for planar shapes using Voronoi skeletons. A new algorithm for the construction of the Voronoi diagram of a polygon with holes is first described. The main features of this algorithm are its robustness in handling the standard degenerate cases (colinearity of more than two points; co-circularity of more than three points), and its ease of implementation. This algorithm is then used to derive accurate and robust skeletons for planar shapes. The shape representation scheme using Voronoi skeletons possesses the important properties of connectivity as well as Euclidean metrics. The resultant representation is stable with respect to being invariant to perturbations along the boundary of the shape.>
Niranjan Mayya, V. T. Rajan
CVPR1
1992 An Efficient Expected Time Parallel Algorithm for Voronoi Construction
Baba C. Vemuri, R. Varadarajan, Niranjan Mayya
SPAA3