Polina Rozenshtein

Orcid: 0000-0003-1714-5567

According to our database1, Polina Rozenshtein authored at least 22 papers between 2014 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
The network-untangling problem: from interactions to activity timelines.
Data Min. Knowl. Discov., 2021

I Wish I Would Have Loved This One, But I Didn't - A Multilingual Dataset for Counterfactual Detection in Product Reviews.
CoRR, 2021

Discovering Dense Correlated Subgraphs in Dynamic Networks.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2021

I Wish I Would Have Loved This One, But I Didn't - A Multilingual Dataset for Counterfactual Detection in Product Review.
Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing, 2021

2020
Finding events in temporal networks: segmentation meets densest subgraph discovery.
Knowl. Inf. Syst., 2020

Relaxing the strong triadic closure problem for edge strength inference.
Data Min. Knowl. Discov., 2020

Mining Dense Subgraphs with Similar Edges.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2020

ESTeR: Combining Word Co-occurrences and Word Associations for Unsupervised Emotion Detection.
Proceedings of the Findings of the Association for Computational Linguistics: EMNLP 2020, 2020

The Role of In-Group Bias and Balanced Data: A Comparison of Human and Machine Recidivism Risk Predictions.
Proceedings of the 3rd ACM SIGCAS Conference on Computing and Sustainable Societies, 2020

2019
Mining Temporal Networks.
Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019

ExCoDE: a Tool for Discovering and Visualizing Regions of Correlation in Dynamic Networks.
Proceedings of the 2019 International Conference on Data Mining Workshops, 2019

2018
Methods for analyzing temporal networks.
PhD thesis, 2018

From acquaintance to best friend forever: robust and fine-grained inference of social tie strengths.
CoRR, 2018

Reconstructing a cascade from temporal observations.
Proceedings of the 2018 SIAM International Conference on Data Mining, 2018

2017
Finding Dynamic Dense Subgraphs.
ACM Trans. Knowl. Discov. Data, 2017

Community-aware network sparsification.
Proceedings of the 2017 SIAM International Conference on Data Mining, 2017

Inferring the Strength of Social Ties: A Community-Driven Approach.
Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017

2016
Discovering Topically- and Temporally-Coherent Events in Interaction Networks.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2016

Temporal PageRank.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2016

Reconstructing an Epidemic Over Time.
Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016

2014
Discovering Dynamic Communities in Interaction Networks.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2014

Event detection in activity networks.
Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014


  Loading...