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.

Bradford Cottel

dblp:242/9320 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2023
0009-0005-8428-8404ORCID · corroborated

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

Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1Databases, data management, data science and information retrieval · 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.

Databases, data mining, and information retrieval
1 paper
Web and social media mining · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware accelerators and domain-specific architectures · 61% Performance modeling and evaluation · 30% Cloud and datacenter computing · 9%

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

TopicWeightPapersLastEvidence papers
Web and social media mining › malicious behavior detection
fake account detection
0.712023
Preemptive Detection of Fake Accounts on Social Networks via Multi-Class Preferential Attachment Classifiers · KDD 2023
Web and social media mining
preferential attachment
0.712023
Preemptive Detection of Fake Accounts on Social Networks via Multi-Class Preferential Attachment Classifiers · KDD 2023
Web and social media mining
social network analysis
0.712023
Preemptive Detection of Fake Accounts on Social Networks via Multi-Class Preferential Attachment Classifiers · KDD 2023
Hardware accelerators and domain-specific architectures
machine learning accelerator
0.412020
The Architectural Implications of Facebook's DNN-Based Personalized Recommendation · HPCA 2020
Hardware accelerators and domain-specific architectures › machine learning accelerator
recommendation model inference
0.412020
The Architectural Implications of Facebook's DNN-Based Personalized Recommendation · HPCA 2020
Performance modeling and evaluation
workload characterization
0.412020
The Architectural Implications of Facebook's DNN-Based Personalized Recommendation · HPCA 2020

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

preferential attachment classifiers · 0.7multiclass classification · 0.7production workload analysis · 0.4batching and co-location study · 0.4
YearPublicationVenuePosition
2023 Preemptive Detection of Fake Accounts on Social Networks via Multi-Class Preferential Attachment Classifiers
abstract
In this paper, we describe a new algorithm called Preferential Attac hment k-class Classifier (PreAttacK) for detecting fake accounts in a social network. Recently, several algorithms have obtained high accuracy on this problem. However, they have done so by relying on information about fake accounts' friendships or the content they share with others-the very things we seek to prevent.
Adam Breuer, Nazanin Khosravani Tehrani, Michael Tingley, Bradford Cottel
KDD4
2020 The Architectural Implications of Facebook's DNN-Based Personalized Recommendation
abstract
The widespread application of deep learning has changed the landscape of computation in data centers. In particular, personalized recommendation for content ranking is now largely accomplished using deep neural networks. However, despite their importance and the amount of compute cycles they consume, relatively little research attention has been devoted to recommendation systems. To facilitate research and advance the understanding of these workloads, this paper presents a set of real-world, production-scale DNNs for personalized recommendation coupled with relevant performance metrics for evaluation. In addition to releasing a set of open-source workloads, we conduct in-depth analysis that underpins future system design and optimization for at-scale recommendation: Inference latency varies by 60% across three Intel server generations, batching and co-location of inference jobs can drastically improve latency-bounded throughput, and diversity across recommendation models leads to different optimization strategies.
Udit Gupta 0001, Carole-Jean Wu, Xiaodong Wang 0020, Maxim Naumov, Brandon Reagen, David Brooks 0001, Bradford Cottel, Kim M. Hazelwood, Mark Hempstead, Bill Jia, Hsien-Hsin S. Lee, Andrey Malevich, Dheevatsa Mudigere, Mikhail Smelyanskiy, Liang Xiong, Xuan Zhang 0001
HPCA7