Tina Eliassi-Rad | Academic Influence

Tina Eliassi-Rad's AcademicInfluence.com Rankings

Tina Eliassi-Rad

Computer Science

#10514

World Rank

#11046

Historical Rank

Data Mining

#274

World Rank

#275

Historical Rank

Machine Learning

#5138

World Rank

#5203

Historical Rank

Database

#8541

World Rank

#8947

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Tina Eliassi-Rad's Degrees

PhD Computer Science University of California, Santa Barbara
Masters Computer Science University of California, Santa Barbara

Similar Degrees You Can Earn

Why Is Tina Eliassi-Rad Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Tina Eliassi-Rad is an American computer scientist and the inaugural President Joseph E. Aoun Professor at Northeastern University. Her research is at the intersection of artificial intelligence , network science, and applied ethics. In 2023, she won the Lagrange Prize for her work on ethical approaches to artificial intelligence.

(See a Problem?)

Tina Eliassi-Rad's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Collective Classification in Network Data (2008) (2730)
RolX: structural role extraction & mining in large graphs (2012) (412)
APATE: A novel approach for automated credit card transaction fraud detection using network-based extensions (2015) (275)
Fast best-effort pattern matching in large attributed graphs (2007) (273)
It's who you know: graph mining using recursive structural features (2011) (254)
Gelling, and melting, large graphs by edge manipulation (2012) (229)
Visual Analysis of Large Heterogeneous Social Networks by Semantic and Structural Abstraction (2006) (202)
A Probabilistic Model for Using Social Networks in Personalized Item Recommendation (2015) (177)
Using ghost edges for classification in sparsely labeled networks (2008) (166)
On the Vulnerability of Large Graphs (2010) (149)
GOTCHA! Network-Based Fraud Detection for Social Security Fraud (2017) (106)
NetSimile: A Scalable Approach to Size-Independent Network Similarity (2012) (105)
The why, how, and when of representations for complex systems (2020) (104)
CoreScope: Graph Mining Using k-Core Analysis — Patterns, Anomalies and Algorithms (2016) (100)
Applying latent dirichlet allocation to group discovery in large graphs (2009) (85)
Network similarity via multiple social theories (2013) (84)
Measuring tie strength in implicit social networks (2011) (79)
Node Immunization on Large Graphs: Theory and Algorithms (2016) (78)
Leveraging Label-Independent Features for Classification in Sparsely Labeled Networks: An Empirical Study (2008) (72)
Metric forensics: a multi-level approach for mining volatile graphs (2010) (71)
Patterns and anomalies in k-cores of real-world graphs with applications (2018) (63)
Guided learning for role discovery (GLRD): framework, algorithms, and applications (2013) (61)
A Guide to Selecting a Network Similarity Method (2014) (60)
HCDF: A Hybrid Community Discovery Framework (2010) (57)
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006) (55)
GRAPHITE: A Visual Query System for Large Graphs (2008) (53)
Entelecheia: Detecting P2P botnets in their waiting stage (2013) (52)
A System for Building Intelligent Agents that Learn to Retrieve and Extract Information (2003) (51)
Two heads better than one: pattern discovery in time-evolving multi-aspect data (2008) (46)
Profiling-By-Association: a resilient traffic profiling solution for the internet backbone (2010) (45)
Eigen-Optimization on Large Graphs by Edge Manipulation (2016) (43)
Knowledge Representation Issues in Semantic Graphs for Relationship Detection (2005) (42)
Generating Graph Snapshots from Streaming Edge Data (2016) (42)
An instructable, adaptive interface for discovering and monitoring information on the World-Wide Web (1998) (39)
Measuring algorithmically infused societies (2021) (39)
Intelligent Agents for Web-based Tasks: An Advice-Taking Approach (1998) (38)
Multilevel Network Alignment (2019) (35)
Reshaping a nation: Mobility, commuting, and contact patterns during the COVID-19 outbreak (2020) (33)
MET: A Fast Algorithm for Minimizing Propagation in Large Graphs with Small Eigen-Gaps (2015) (30)
Classification of HTTP Attacks: A Study on the ECML/PKDD 2007 Discovery Challenge (2009) (30)
Finding Mixed-Memberships in Social Networks (2008) (29)
Detecting Novel Discrepancies in Communication Networks (2010) (29)
Collective Classi!cation in Network Data (2008) (28)
Stability of democracies: a complex systems perspective (2018) (28)
Non-backtracking cycles: length spectrum theory and graph mining applications (2019) (26)
RolX: Role Extraction and Mining in Large Networks (2011) (25)
Link Homophily in the Application Layer and its Usage in Traffic Classification (2010) (24)
Measuring and Improving the Core Resilience of Networks (2018) (22)
Correcting evaluation bias of relational classifiers with network cross validation (2010) (21)
Fast mining of complex time-stamped events (2008) (20)
Evaluating Statistical Tests for Within-Network Classifiers of Relational Data (2009) (19)
A Theory-Refinement Approach to Information Extraction (2001) (19)
Fast Best-Effort Search on Graphs with Multiple Attributes (2015) (19)
Data Sciences Technology for Homeland Security Information Management and Knowledge Discovery (2005) (19)
Building Intelligent Agents for Web-Based Tasks: A Theory-Refinement Approach (1998) (18)
Guilt-by-Constellation: Fraud Detection by Suspicious Clique Memberships (2015) (17)
MaxReach: Reducing network incompleteness through node probes (2016) (15)
Massively parallel acceleration of a document-similarity classifier to detect web attacks (2011) (14)
Success in books: predicting book sales before publication (2019) (14)
An Examination of Experimental Methodology for Classifiers of Relational Data (2007) (13)
EP-MEANS: an efficient nonparametric clustering of empirical probability distributions (2015) (12)
ε - WGX: Adaptive Edge Probing for Enhancing Incomplete Networks (2017) (12)
Geometric Laplacian Eigenmap Embedding (2019) (12)
Node Immunization with Non-backtracking Eigenvalues (2020) (11)
Continuous Time Group Discovery in Dynamic Graphs (2010) (11)
Correcting Bias in Statistical Tests for Network Classifier Evaluation (2011) (11)
Residual Core Maximization: An Efficient Algorithm for Maximizing the Size of the k-Core (2020) (11)
Gateway finder in large graphs: problem definitions and fast solutions (2012) (10)
Improving Robustness to Attacks Against Vertex Classification (2019) (10)
HYPA: Efficient Detection of Path Anomalies in Time Series Data on Networks (2019) (10)
AFRAID: Fraud detection via active inference in time-evolving social networks (2015) (10)
The evolution of a hierarchical partitioning algorithm for large-scale scientific data: three steps of increasing complexity (2003) (10)
MaxOutProbe: An Algorithm for Increasing the Size of Partially Observed Networks (2015) (10)
Intelligent Web Agents that Learn to Retrieve and Extract Information (2003) (10)
On Designing Machine Learning Models for Malicious Network Traffic Classification (2019) (9)
Statistical modeling of large-scale simulation data (2002) (8)
PaCK: Scalable parameter-free clustering on K-partite graphs (2009) (8)
Using Ontological Information to Accelerate Path-Finding in Large Semantic Graphs: A Probabilistic Approach (2005) (8)
DAPA-V10: Discovery and Analysis of Patterns and Anomalies in Volatile Time-Evolving Networks (2009) (7)
BASSET: Scalable Gateway Finder in Large Graphs (2010) (7)
NimbleCore: A space-efficient external memory algorithm for estimating core numbers (2016) (7)
Current and Future Challenges in Mining Large Networks: Report on the Second SDM Workshop on Mining Networks and Graphs (2016) (6)
Which Network Similarity Measure Should You Choose: An Empirical Study (2013) (6)
RAWLSNET: Altering Bayesian Networks to Encode Rawlsian Fair Equality of Opportunity (2021) (6)
Leveraging Network Structure to Infer Missing Values in Relational Data (2007) (6)
Instructable and Adaptive Web Agents that Learn to Retrieve and Extract Information (2000) (6)
Graph Distance from the Topological View of Non-backtracking Cycles (2018) (6)
The Responsibility Challenge for Data (2019) (6)
Hyperlocal: inferring location of IP addresses in real-time bid requests for mobile ads (2013) (5)
Sequential Motifs in Observed Walks (2021) (5)
Local Structural Features Threaten Privacy across Social Networks (2013) (5)
PORTFILER: Port-Level Network Profiling for Self-Propagating Malware Detection (2021) (5)
Mining data from mobile devices: a survey of smart sensing and analytics (2013) (5)
Learning Laplacian Matrix from Graph Signals with Sparse Spectral Representation (2021) (5)
Deep Reinforcement Learning for Task-driven Discovery of Incomplete Networks (2019) (4)
What science can do for democracy: a complexity science approach (2020) (4)
Mining Mobility Data (2015) (4)
A Renewal Theory Approach to Anomaly Detection in Communication Networks (2010) (4)
PATHATTACK: Attacking Shortest Paths in Complex Networks (2021) (4)
Literature Search through Mixed-Membership Community Discovery (2009) (4)
Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Philadelphia, PA, USA, August 20-23, 2006 (2006) (4)
Information Access Equality on Network Generative Models (2021) (3)
FINDING THE MOST APPROPRIATE AUXILIARY DATA FOR SOCIAL GRAPH DEANONYMIZATION (2014) (3)
L2P: An Algorithm for Estimating Heavy-tailed Outcomes (2019) (3)
Solving the Top-K Problem with Fixed-Memory Heuristic Search (2009) (3)
Detecting Path Anomalies in Time Series Data on Networks (2019) (3)
Higher-Order Graph Models: From Theoretical Foundations to Machine Learning (Dagstuhl Seminar 21352) (2021) (3)
Understanding the limitations of network online learning (2020) (3)
Multivariate Clustering of Large-Scale Scientific Simulation Data (2003) (2)
A hybrid approach for multiresolution modeling of large-scale scientific data (2005) (2)
Topological Effects on Attacks Against Vertex Classification (2020) (2)
A Position Paper: Value of Information for Evidence Detection (2006) (2)
Incompleteness in Networks: Biases, Skewed Results, and Some Solutions (2019) (2)
Integrity 2020: Integrity in Social Networks and Media (2020) (2)
Enhanced Anomaly Detection in Imbalanced Credit Card Transactions using Hybrid PSO (2016) (2)
Information access equality on generative models of complex networks (2022) (2)
Collaborative Information Sharing for ML-Based Threat Detection (2021) (1)
Threatening Privacy across Social Graphs: A Structural Features Approach (2014) (1)
Leveraging Structure to Improve Classification Performance in Sparsely Labeled Networks (2007) (1)
Statistical Modeling of Large-Scale Scientific Simulation Data (2003) (1)
Multivariate Clustering of Large-Scale Simulation Data (2003) (1)
Selective network discovery via deep reinforcement learning on embedded spaces (2019) (1)
A Collection of Features for Semantic Graphs (2007) (1)
Using a Trained Text Classifier to Extract Information (1999) (1)
Understanding Offline Political Systems by Mining Online Political Data (2016) (1)
NetSimile : Agnostic Network Similarity via Multiple Social Theories (2013) (1)
Ranking Information in Networks (2011) (1)
A path-based approach to analyzing the global liner shipping network (2021) (1)
Some Advances in Role Discovery in Graphs (2016) (1)
Learning to Predict the Presence of Nodes in Anonymized Graphs (2014) (0)
BiaScope: Visual Unfairness Diagnosis for Graph Embeddings (2022) (0)
Optimal Edge Weight Perturbations to Attack Shortest Paths (2021) (0)
VISUAL SUPPORT FOR THE ISLE SIMULATION ENVIRONMENT (1995) (0)
RolX : Extracting Predictive Roles from Graphs (2011) (0)
ADAGE: A Framework for Generating Adaptable Intervals from Streaming Edges (2014) (0)
Tina Eliassi-Rad, Terence Critchlow, Ghaleb Abdulla. (2002) (0)
Gateway finder in large graphs: problem definitions and fast solutions (2012) (0)
Optimal Intervention on Weighted Networks via Edge Centrality (2023) (0)
Non-backtracking cycles: length spectrum theory and graph mining applications (2019) (0)
Measuring Coverage and Divergence of Reading Behaviors Among Friends (2014) (0)
Correcting evaluation bias of relational classifiers with network cross validation (2011) (0)
Approximate Inference Algorithms for Approaches based on Local Conditional Classifiers (2007) (0)
Success in books: predicting book sales before publication (2019) (0)
Similarity in Computational Sciences (2005) (0)
Social Order in Online Social Networks (2014) (0)
Non-backtracking Eigenvalues under Node Removal: X-Centrality and Targeted 1 Immunization (2021) (0)
An Axiomatic Approach to Tie-Strength Measures (2011) (0)
API Requirements for Dynamic Graph Prediction (2006) (0)
Research in Industrial Projects for Students 1 Project Proposal : The Disambiguation Problem Industrial Partner : Lawrence Livermore National Laboratory Industrial (2006) (0)
Finding cliques in large fraudulent networks: theory and insights (2014) (0)
Rutgers University Subcontract B611610 Final Report (2015) (0)
Scalable algorithms for semantic graph analysis. (2005) (0)
Detecting Novel Discrepancies in Highly Dynamic Information Networks (0)
Identifying and Mitigating Instability in Embeddings of the Degenerate Core (2022) (0)
Statistical Tests for Network Classifier Evaluation (2010) (0)
CELEST: Federated Learning for Globally Coordinated Threat Detection (2022) (0)
Length Spectrum Theory, Non-backtracking Cycles, and Two Graph Analysis Tasks (2019) (0)
Understanding the limitations of network online learning (2020) (0)
NetSimile : Scalable Network Similarity via Multiple Social Theories (2014) (0)
Selective network discovery via deep reinforcement learning on embedded spaces (2021) (0)
Gotch’all! Advanced network analysis for detecting groups of fraud (2014) (0)
Strategies for Probing Incomplete Graphs. (2014) (0)
Analysis and Visualization Considerations for Quantitative Social Science Research Using Social Media Data (2021) (0)
K-cores in Time-evolving Co-authorship Graphs : A Case Study on DBLP (2015) (0)
Session details: Research track 8: graph algorithms (2010) (0)
Patterns and anomalies in k-cores of real-world graphs with applications (2017) (0)
Enriching Incomplete Networks (2015) (0)
MINIMIZING DISSEMINATION ON LARGE GRAPHS (2014) (0)
Optimizing Graph Structure for Targeted Diffusion (2020) (0)

This paper list is powered by the following services:

Other Resources About Tina Eliassi-Rad

en.wikipedia.org

What Schools Are Affiliated With Tina Eliassi-Rad?

Tina Eliassi-Rad is affiliated with the following schools: