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

Blake Anderson

dblp:86/9168 · DBLP profile ↗
← Back
15ranked-venue papers
6as first author
3since 2021 · last 2023
—ORCID · conflict

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

Applied, interdisciplinary, general and emerging computing · 6 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 5 · 3 first-authorArtificial intelligence and machine learning · 4 · 3 first-author · 1 since 2021Computer networks · 2 · 1 first-authorSecurity and privacy · 2 · 1 first-author · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 since 2021

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
4 papers
Network security · 60% Malware analysis · 40%
Databases, data mining, and information retrieval
2 papers
Data mining · 54% Information retrieval · 46%
Computer networks
2 papers
Network measurement and analytics · 69% Internet architecture and protocols · 31%
Artificial intelligence
1 paper
Optimization for machine learning · 100%
Software engineering, system software, and programming languages
1 paper
Empirical software engineering · 100%

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

TopicWeightPapersLastEvidence papers
Network security › traffic analysis › encrypted traffic analysis
encrypted traffic classification
0.312017
Machine Learning for Encrypted Malware Traffic Classification: Accounting for Noisy Labels and Non-Stationarity · KDD 2017
Malware analysis › malware
malware traffic classification
0.312017
Machine Learning for Encrypted Malware Traffic Classification: Accounting for Noisy Labels and Non-Stationarity · KDD 2017
Malware analysis › malware defense
network-based malware detection
0.312017
Machine Learning for Encrypted Malware Traffic Classification: Accounting for Noisy Labels and Non-Stationarity · KDD 2017
Network measurement and analytics
flow monitoring
0.212016
Enhanced telemetry for encrypted threat analytics · ICNP 2016
Network security › traffic analysis
encrypted traffic analysis
0.212016
Enhanced telemetry for encrypted threat analytics · ICNP 2016
Machine learning › Optimization for machine learning › convex optimization
semidefinite programming
0.112012
Multiple Kernel Learning Clustering with an Application to Malware · ICDM 2012
Data mining
clustering
0.112012
Multiple Kernel Learning Clustering with an Application to Malware · ICDM 2012
Data mining › clustering
multiple kernel clustering
0.112012
Multiple Kernel Learning Clustering with an Application to Malware · ICDM 2012
Data mining › clustering
spectral clustering
0.112012
Multiple Kernel Learning Clustering with an Application to Malware · ICDM 2012
Information retrieval
search engines
0.112011
Why searchers switch: understanding and predicting engine switching rationales · SIGIR 2011
Information retrieval › search engines
search engine switching
0.112011
Why searchers switch: understanding and predicting engine switching rationales · SIGIR 2011
Information retrieval
user behavior
0.112011
Why searchers switch: understanding and predicting engine switching rationales · SIGIR 2011
Empirical software engineering › developer studies
user study
0.112011
Why searchers switch: understanding and predicting engine switching rationales · SIGIR 2011
Internet architecture and protocols › network security
TLS
0.112019
TLS Beyond the Browser: Combining End Host and Network Data to Understand Application Behavior · Internet Measurement Conference 2019
Malware analysis › malware similarity
malware clustering
0.012012
Multiple Kernel Learning Clustering with an Application to Malware · ICDM 2012

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

end host and network data correlation · 0.8machine learning classifier · 0.5semidefinite programming · 0.4multiple kernel learning · 0.4interior-point method · 0.3random forest · 0.3linear regression · 0.3feature engineering · 0.3client-side instrumentation · 0.2behavioral modeling · 0.2interior point method · 0.1
YearPublicationVenuePosition
2023 Prioritizing Remediation of Enterprise Hosts by Malware Execution Risk
abstract
Defending an enterprise network requires making prioritization decisions daily; one is deciding which compromised hosts to remediate (reimage). We study the utility of endpoint monitoring data to perform this prioritization, with the driving goal being to minimize “regret” as measured by future (next-week) malware execution on hosts whose remediation was deprioritized. Leveraging data gathered by the vendor of a major endpoint protection product, we show that it is possible to prioritize remediation by training a classifier that predicts imminent malware execution. Perhaps surprisingly, while it might seem essential to maximize the amount of training data by collecting across an array of enterprises to which endpoint protection is deployed, at least in the case of the endpoint protection vendor (itself a major, worldwide company), predictive performance for a single enterprise can remain excellent when training is restricted to the enterprise itself. One advantage of single-enterprise training is the ease of combining different views of the hosts, such as via file-based and network-based monitoring. In the cases studied, although an exact comparison was impossible due to a time gap, the single-enterprise dataset with richer features resulted in superior prediction of malware execution compared to the multi-enterprise dataset.
Andrew Chi, Blake Anderson, Michael K. Reiter
ACSAC2
2022 Yours, Mine, and Ours: Exploring When Your Data Becomes Health Data
Amanda L. Purnell, Priya Joshi, Blake Anderson, Cole Zanetti, Helga E. Rippen
AMIA3
2022 AugRE: Augmented Robot Environment to Facilitate Human-Robot Teaming and Communication
abstract
Augmented Reality (AR) provides a method to superimpose real-time information on the physical world. AR is well-suited for complex robotic systems to help users understand robot behavior, status, and intent. This paper presents an AR system, Augmented Robot Environment (AugRE), that combines ROS-based robotic systems with Microsoft HoloLens 2 AR headsets to form a scalable multi-agent human-robot teaming system for indoor and outdoor exploration. The system allows multiple users to simultaneously localize, supervise, and receive labeled images from robotic clients. An overview of AugRE and details of the novel system architecture that allows for large-scale human-robot teaming is presented below. Studies showcasing system performance with multiple robotic clients are presented. Results show that AugRE can scale to 50 robotic clients with minimal performance degradation, due in part to key components that leverage a recent advancement in robotic client-to-client communication called Robofleet. Finally we discuss new capabilities enabled by AugRE.
Frank Regal, Christina Petlowany, Can Pehlivanturk, Corrie Van Sice, Chris Suarez, Blake Anderson, Mitchell W. Pryor
RO-MAN6
2020 Hekademeia: Sustainable Research Technology Infrastructure for Persistent Project Access Across Funding Gaps
Blake Anderson, Blaine Reeder
AMIA1
2019 Limitless HTTP in an HTTPS World: Inferring the Semantics of the HTTPS Protocol without Decryption
abstract
We present new analytic techniques for inferring HTTP semantics from passive observations of HTTPS that can infer the value of important fields including the status-code, Content-Type, and Server, and the presence or absence of several additional HTTP header fields, e.g., Cookie and Referer. Our goals are to improve the understanding of the confidentiality limitations of HTTPS, and to explore benign uses of traffic analysis that could replace HTTPS interception and static private keys in some scenarios. We found that our techniques increase the efficacy of malware detection, but they do not enable more powerful website fingerprinting attacks against Tor. Our broader set of results raises concerns about the confidentiality goals of TLS relative to a user's expectation of privacy, warranting future research. We apply our methods to the semantics of both HTTP/1.1 and HTTP/2 on data collected from automated runs of Firefox 58.0, Chrome 63.0, and Tor Browser 7.0.11 in a lab setting, and from applications running in a malware sandbox. We obtain ground truth plaintext for a diverse set of applications from the malware sandbox by extracting the key material needed for decryption from RAM post-execution. We developed an iterative approach to simultaneously solve several multi-class (field values) and binary (field presence) classification problems, and we show that our inference algorithm achieves an unweighted $F_1$ score greater than 0.900 for most HTTP fields examined.
Blake Anderson, Andrew Chi, Scott Dunlop, David A. McGrew
CODASPY1
2019 TLS Beyond the Browser: Combining End Host and Network Data to Understand Application Behavior
abstract
The Transport Layer Security (TLS) protocol has evolved in response to different attacks and is increasingly relied on to secure Internet communications. Web browsers have led the adoption of newer and more secure cryptographic algorithms and protocol versions, and thus improved the security of the TLS ecosystem. Other application categories, however, are increasingly using TLS, but too often are relying on obsolete and insecure protocol options.
Blake Anderson, David A. McGrew
Internet Measurement Conference1
2017 Machine Learning for Encrypted Malware Traffic Classification: Accounting for Noisy Labels and Non-Stationarity
abstract
The application of machine learning for the detection of malicious network traffic has been well researched over the past several decades; it is particularly appealing when the traffic is encrypted because traditional pattern-matching approaches cannot be used. Unfortunately, the promise of machine learning has been slow to materialize in the network security domain. In this paper, we highlight two primary reasons why this is the case: inaccurate ground truth and a highly non-stationary data distribution. To demonstrate and understand the effect that these pitfalls have on popular machine learning algorithms, we design and carry out experiments that show how six common algorithms perform when confronted with real network data. With our experimental results, we identify the situations in which certain classes of algorithms underperform on the task of encrypted malware traffic classification. We offer concrete recommendations for practitioners given the real-world constraints outlined. From an algorithmic perspective, we find that the random forest ensemble method outperformed competing methods. More importantly, feature engineering was decisive; we found that iterating on the initial feature set, and including features suggested by domain experts, had a much greater impact on the performance of the classification system. For example, linear regression using the more expressive feature set easily outperformed the random forest method using a standard network traffic representation on all criteria considered. Our analysis is based on millions of TLS encrypted sessions collected over 12 months from a commercial malware sandbox and two geographically distinct, large enterprise networks.
Blake Anderson, David A. McGrew
KDD1
2016 Enhanced telemetry for encrypted threat analytics
abstract
Traditional flow monitoring provides a high-level view of network communications by reporting the addresses, ports, and byte and packet counts of a flow. This data is valuable, but it gives little insight into the actual content or context of a flow. To obtain this missing insight, we investigated intra-flow data, that is, information about events that occur inside of a flow that can be conveniently collected, stored, and analyzed within a flow monitoring framework. The focus of our work is on new types of data that are independent of protocol details, such as the lengths and arrival times of messages within a flow. These data elements have the attractive property that they apply equally well to both encrypted and unencrypted flows. Protocol-aware telemetry, specifically TLS-aware telemetry, is also analyzed. In this paper, we explore the benefits of enhanced telemetry, desirable properties of new intra-flow data features with respect to a flow monitoring system, and how best to use machine learning classifiers that operate on this data. We provide results on millions of flows processed by our open source program. Finally, we show that leveraging appropriate data features and simple machine learning models can successfully identify threats in encrypted network traffic.
David A. McGrew, Blake Anderson
ICNP2
2014 Malware Phylogenetics Based on the Multiview Graphical Lasso
Blake Anderson, Terran Lane, Curtis Hash
IDA1
2013 TeleMDID: Mobile technology applications for interactive diagnoses in teledermatology clinics
abstract
Over the past two decades, teledermatology has typically applied a hybrid model with both live-interactive and store-and-forward imaging technology during the diagnosis process. The primary challenges for teledermatology are integrations of diagnostic information and images captured by heterogeneous digital cameras used by the far sites, image sharing tools by the dermatologists and patients, and means for longitudinal diagnosis of skin diseases. These challenges not only cause disruptive clinic flow, but also limit the capability for the efficacy of diagnoses. The objectives of this study are to adapt mobile applications from in-person clinical to telehealth settings, and evaluate and compare its usability, effectiveness, and changes in clinic flow.
Mirna Becevic, Blake Anderson, Jing Ginger Han, E. Rachel Mutrux, Lanis Hicks, Karen Edison, Chi-Ren Shyu
Healthcom2
2012 A Study of Dermatological Image Search, Archive, and Use Behaviors
Blake Anderson, Jonathan Dyer, Chi-Ren Shyu
AMIA3
2012 Improving disease management through a mobile application for lymphedema patients
abstract
Breast cancer-related lymphedema (LE) is one type of incurable progressive chronic disease caused by cancer treatment or surgery that damages a patient's lymphatic system. Many patients are unaware of available treatment and places to seek for help with LE. This paper introduces a framework for a mobile application package for LE patients or patients at-risk to 1) locate available trained therapists using embedded Google Map technology; 2) monitor disease progression using profile match and rules mining; and 3) acquire up-to-date LE research findings based on patient characteristics. It aims to increase patients' accessibility to available resources and improve patient's quality of life by a mHealth-driven disease management approach.
Christine Shuyu Xu, Blake Anderson, Jane Armer, Chi-Ren Shyu
Healthcom2
2012 Multiple Kernel Learning Clustering with an Application to Malware
abstract
With the increasing prevalence of richer, more complex data sources, learning with multiple views is becoming more widespread. Multiple kernel learning (MKL) has been developed to address this problem, but in general, the solutions provided by traditional MKL are restricted to a classification objective function. In this work, we develop a novel multiple kernel learning algorithm that is based on a spectral clustering objective function which is able to find an optimal kernel weight vector for the clustering problem. We go on to show how this optimization problem can be cast as a semidefinite program and efficiently solved using off-the-shelf interior point methods.
Blake Anderson, Curtis B. Storlie, Terran Lane
ICDM1
2012 Role of domain knowledge in developing user-centered medical-image indexing
abstract
Abstract An efficient and robust medical‐image indexing procedure should be user‐oriented. It is essential to index the images at the right level of description and ensure that the indexed levels match the user's interest level. This study examines 240 medical‐image descriptions produced by three different groups of medical‐image users (novices, intermediates, and experts) in the area of radiography. This article reports several important findings: First, the effect of domain knowledge has a significant relationship with the use of semantic image attributes in image‐users' descriptions. We found that experts employ more high‐level image attributes which require high‐reasoning or diagnostic knowledge to search for a medical image (Abstract Objects and Scenes) than do novices; novices are more likely to describe some basic objects which do not require much radiological knowledge to search for an image they need (Generic Objects) than are experts. Second, all image users in this study prefer to use image attributes of the semantic levels to represent the image that they desired to find, especially using those specific‐level and scene‐related attributes. Third, image attributes generated by medical‐image users can be mapped to all levels of the pyramid model that was developed to structure visual information. Therefore, the pyramid model could be considered a robust instrument for indexing medical imagery.
Sanda Erdelez, Carla Allen, Blake Anderson, Hongfei Cao, Chi-Ren Shyu
J. Assoc. Inf. Sci. Technol.4
2011 Why searchers switch: understanding and predicting engine switching rationales
abstract
Search engine switching is the voluntary transition between Web search engines. Engine switching can occur for a number of reasons, including user dissatisfaction with search results, a desire for broader topic coverage or verification, user preferences, or even unintentionally. An improved understanding of switching rationales allows search providers to tailor the search experience according to the different causes. In this paper we study the reasons behind search engine switching within a session. We address the challenge of identifying switching rationales by designing and implementing client-side instrumentation to acquire in-situ feedbacks from users. Using this feedback, we investigate in detail the reasons that users switch engines within a session. We also study the relationship between implicit behavioral signals and the switching causes, and develop and evaluate models to predict the reasons for switching. In addition, we collect editorial judgments of switching rationales by third-party judges and show that we can recover switching causes a posteriori. Our findings provide valuable insights into why users switch search engines in a session and demonstrate the relationship between search behavior and switching motivations. The findings also reveal sufficient behavioral consistency to afford accurate prediction of switching rationale, which can be used to dynamically adapt the search experience and derive more accurate competitive metrics.
Qi Guo 0002, Ryen W. White, Yunqiao Zhang, Blake Anderson, Susan T. Dumais
SIGIR4