• Publications
  • Influence
An efficient signature representation and matching method for mobile devices
TLDR
The increase in functionality and service offerings of mobile devices and mobile networks has prompted the need to offer better security for these devices. Expand
  • 24
  • 4
Relieving the Computational Bottleneck: Joint Inference for Event Extraction with High-Dimensional Features
TLDR
In this paper, we propose a new model for event extraction that combines the power of MLNs and SVMs, dwarfing their limitations. Expand
  • 42
  • 3
  • PDF
Scalable Training of Markov Logic Networks Using Approximate Counting
TLDR
In this paper, we propose principled weight learning algorithms for Markov logic networks that can easily scale to much larger datasets and application domains than existing algorithms. Expand
  • 19
  • 3
  • PDF
On Lifting the Gibbs Sampling Algorithm
TLDR
We propose an approach for constructing the clusters and show how it can be used to trade accuracy with computational complexity in a principled manner. Expand
  • 51
  • 1
  • PDF
Evidence-Based Clustering for Scalable Inference in Markov Logic
TLDR
Lifted inference algorithms take advantage of symmetries in first-order probabilistic logic representations such as Markov logic networks and are naturally more scalable than propositional inference algorithms which ground the MLN. Expand
  • 36
  • 1
  • PDF
Detecting Review Manipulation on Online Platforms with Hierarchical Supervised Learning
TLDR
We propose a novel hierarchical supervised-learning approach to increase the likelihood of detecting anomalies by analyzing several user features and then characterizing their collective behavior in a unified manner. Expand
  • 40
  • 1
Just Count the Satisfied Groundings: Scalable Local-Search and Sampling Based Inference in MLNs
TLDR
The main computational bottleneck in various sampling based and local-search based inference algorithms for Markov logic networks (e.g., Gibbs sampling, MC-SAT, MaxWalksat, etc.) is computing the number of groundings of a first-order formula that are true given a truth assignment to all of its ground atoms. Expand
  • 17
  • 1
  • PDF
A Malware Signature Extraction and Detection Method Applied to Mobile Networks
TLDR
In this paper, we describe a system for detecting malware within the network traffic using malware signatures. Expand
  • 20
  • 1
Dynamic Blocking and Collapsing for Gibbs Sampling
TLDR
In this paper, we investigate combining blocking and collapsing - two widely used strategies for improving the accuracy of Gibbs sampling - in the context of probabilistic graphical models. Expand
  • 15
  • 1
  • PDF
Comparative Analysis of ML Classifiers for Network Intrusion Detection
TLDR
We present a comprehensive analysis of some existing machine learning classifiers regarding identifying intrusions in network traffic and summarize their effectiveness using a detailed experimental evaluation. Expand
  • 5
  • 1
  • PDF