Browsing NTNU Open by Author "Chitrakar, Ambika Shrestha"
Now showing items 1-5 of 5
-
Analyzing Digital Evidence Using Parallel k-means with Triangle Inequality on Spark
Chitrakar, Ambika Shrestha; Petrovic, Slobodan (Chapter; Peer reviewed, 2018)Analyzing digital evidence has become a big data problem, which requires faster methods to handle them on a scalable framework. Standard k-means clustering algorithm is widely used in analyzing digital evidence. However, ... -
Approximate search with constraints on indels with application in SPAM filtering
Chitrakar, Ambika Shrestha; Petrovic, Slobodan (Journal article; Peer reviewed, 2015)Finding distorted occurrences of search pattern(s) in the search string by applying constraints on elementary edit operations (indels (insertions/deletions) and substitutions) is a new category of the approximate string ... -
Collecting Network Evidence Using Constrained Approximate Search Algorithms
Chitrakar, Ambika Shrestha; Petrovic, Slobodan (Journal article; Peer reviewed, 2018)Intrusion detection systems are defensive tools that identify malicious activities in networks and hosts. In network forensics, investigators often study logs that store alerts generated by intrusion detection systems. ... -
Constrained Approximate Search and Data Reduction Techniques in Cybersecurity and Digital Forensics
Chitrakar, Ambika Shrestha (Doctoral theses at NTNU;2019:315, Doctoral thesis, 2019) -
Efficient k-means Using Triangle Inequality on Spark for Cyber Security Analytics
Chitrakar, Ambika Shrestha; Petrovic, Slobodan (Chapter, 2019)With the advancement in technology and the increase in the number of digital sources, data quantity increases every day and, consequently, the cyber security related data quantity. Traditional security systems such as ...