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

Lora Weiss

dblp:50/7975 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2013
—ORCID · none

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

Artificial intelligence and machine learning · 2Security and privacy · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 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.

Databases, data mining, and information retrieval
1 paper
Data mining · 87% Data models and query languages · 13%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

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

TopicWeightPapersLastEvidence papers
Data mining
anomaly detection
0.212013
Detecting insider threats in a real corporate database of computer usage activity · KDD 2013
Data mining › anomaly detection
graph anomaly detection
0.212013
Detecting insider threats in a real corporate database of computer usage activity · KDD 2013
Algorithmic game theory and mechanism design › equilibrium computation
correlated equilibrium
0.112011
Quick Polytope Approximation of All Correlated Equilibria in Stochastic Games · AAAI 2011
Algorithmic game theory and mechanism design
stochastic games
0.112011
Quick Polytope Approximation of All Correlated Equilibria in Stochastic Games · AAAI 2011
Data models and query languages › query language
visual query language
0.012013
Detecting insider threats in a real corporate database of computer usage activity · KDD 2013

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

temporal sequence analysis · 0.2statistical anomaly detection · 0.2dynamic graph processing · 0.2polytope approximation · 0.1
YearPublicationVenuePosition
2013 A model docking system for understanding radicalization
abstract
Modeling behavior related to radicalization and terrorism is extremely complex. Consequently, the development of computational approaches to support an understanding of behavioral underpinnings that lead up to radicalization is a significant undertaking and necessitates either a decomposition of behavioral activity into smaller, more manageable behaviors or generalizing larger, group behavior so that only gross trends may be observed. While these approaches may suffice for particular applications, additional consideration should be given to developing more comprehensive or whole-system modeling approaches so as to inform decision-makers in making complex judgments. Specifically for those seeking to understand and stop terrorism, a number of social, cultural, and behavioral perspectives are being developed by experts worldwide. Our research seeks to develop computational methods to analyze and experiment with differing views, opinions, and perspectives of potential influences on adversarial behavior by providing the capability to `dock' or integrate models. We demonstrate how this ability allows for a multi-scale comprehension of the factors that contribute to radicalization.
Lora Weiss, Erica Briscoe, Walter Wright, Simeon Harbert, Keith Kline, John Horgan, Lily Cushenbery, Casey Hilland
ISI1
2013 Detecting insider threats in a real corporate database of computer usage activity
abstract
This paper reports on methods and results of an applied research project by a team consisting of SAIC and four universities to develop, integrate, and evaluate new approaches to detect the weak signals characteristic of insider threats on organizations' information systems. Our system combines structural and semantic information from a real corporate database of monitored activity on their users' computers to detect independently developed red team inserts of malicious insider activities. We have developed and applied multiple algorithms for anomaly detection based on suspected scenarios of malicious insider behavior, indicators of unusual activities, high-dimensional statistical patterns, temporal sequences, and normal graph evolution. Algorithms and representations for dynamic graph processing provide the ability to scale as needed for enterprise-level deployments on real-time data streams. We have also developed a visual language for specifying combinations of features, baselines, peer groups, time periods, and algorithms to detect anomalies suggestive of instances of insider threat behavior. We defined over 100 data features in seven categories based on approximately 5.5 million actions per day from approximately 5,500 users. We have achieved area under the ROC curve values of up to 0.979 and lift values of 65 on the top 50 user-days identified on two months of real data.
Ted E. Senator, Henry G. Goldberg, Alex Memory, William T. Young, Bradley Rees, Robert Pierce, Daniel Huang 0003, Matthew Reardon, David A. Bader, Edmond Chow, Irfan A. Essa, Joshua Jones, Vinay Bettadapura, Polo Chau, Oded Green, Oguz Kaya, Anita Zakrzewska, Erica Briscoe, Rudolph Louis Mappus IV, Robert McColl, Lora Weiss, Thomas G. Dietterich, Alan Fern, Weng-Keen Wong, Shubhomoy Das, Andrew Emmott, Jed Irvine, Jay-Yoon Lee, Danai Koutra, Christos Faloutsos, Daniel D. Corkill, Lisa Friedland, Amanda Gentzel, David D. Jensen
KDD21
2011 Quick Polytope Approximation of All Correlated Equilibria in Stochastic Games
abstract
Stochastic or Markov games serve as reasonable models for a variety of domains from biology to computer security, and are appealing due to their versatility. In this paper we address the problem of finding the complete set of correlated equilibria for general-sum stochastic games with perfect information. We present QPACE — an algorithm orders of magnitude more efficient than previous approaches while maintaining a guarantee of convergence and bounded error. Finally, we validate our claims and demonstrate the limits of our algorithm with extensive empirical tests.
Liam MacDermed, Karthik S. Narayan, Charles L. Isbell Jr., Lora Weiss
AAAI4