Остановите войну!
for scientists:
default search action
Nikolaj Tatti
- > Home > Persons > Nikolaj Tatti
Publications
- 2023
- [c46]Guangyi Zhang, Nikolaj Tatti, Aristides Gionis:
Finding Favourite Tuples on Data Streams with Provably Few Comparisons. KDD 2023: 3229-3238 - [c44]Guangyi Zhang, Nikolaj Tatti, Aristides Gionis:
Ranking with submodular functions on the fly. SDM 2023: 604-612 - [i55]Guangyi Zhang, Nikolaj Tatti, Aristides Gionis:
Ranking with submodular functions on the fly. CoRR abs/2301.06787 (2023) - [i53]Guangyi Zhang, Nikolaj Tatti, Aristides Gionis:
Finding Favourite Tuples on Data Streams with Provably Few Comparisons. CoRR abs/2307.02946 (2023) - 2022
- [j32]Guangyi Zhang, Nikolaj Tatti, Aristides Gionis:
Ranking with submodular functions on a budget. Data Min. Knowl. Discov. 36(3): 1197-1218 (2022) - [c41]Guangyi Zhang, Nikolaj Tatti, Aristides Gionis:
Coresets remembered and items forgotten: submodular maximization with deletions. ICDM 2022: 676-685 - [i50]Guangyi Zhang, Nikolaj Tatti, Aristides Gionis:
Optimal deletion-robust coreset for submodular maximization. CoRR abs/2203.01241 (2022) - [i49]Guangyi Zhang, Nikolaj Tatti, Aristides Gionis:
Ranking with submodular functions on a budget. CoRR abs/2204.04168 (2022) - 2021
- [j30]Polina Rozenshtein, Nikolaj Tatti, Aristides Gionis:
The network-untangling problem: from interactions to activity timelines. Data Min. Knowl. Discov. 35(1): 213-247 (2021) - 2020
- [j29]Polina Rozenshtein, Francesco Bonchi, Aristides Gionis, Mauro Sozio, Nikolaj Tatti:
Finding events in temporal networks: segmentation meets densest subgraph discovery. Knowl. Inf. Syst. 62(4): 1611-1639 (2020) - 2019
- [i33]Nikolaj Tatti, Taneli Mielikäinen, Aristides Gionis, Heikki Mannila:
What is the dimension of your binary data? CoRR abs/1902.01480 (2019) - [i32]Nikolaj Tatti, Aristides Gionis:
Discovering Nested Communities. CoRR abs/1902.01483 (2019) - [i30]Polina Rozenshtein, Nikolaj Tatti, Aristides Gionis:
Inferring the strength of social ties: a community-driven approach. CoRR abs/1902.01832 (2019) - [i17]Nikolaj Tatti, Aristides Gionis:
Density-friendly Graph Decomposition. CoRR abs/1904.03467 (2019) - 2018
- [c36]Polina Rozenshtein, Francesco Bonchi, Aristides Gionis, Mauro Sozio, Nikolaj Tatti:
Finding Events in Temporal Networks: Segmentation Meets Densest-Subgraph Discovery. ICDM 2018: 397-406 - [c32]Han Xiao, Polina Rozenshtein, Nikolaj Tatti, Aristides Gionis:
Reconstructing a cascade from temporal observations. SDM 2018: 666-674 - [i10]Han Xiao, Polina Rozenshtein, Nikolaj Tatti, Aristides Gionis:
Reconstructing a cascade from temporal observations. CoRR abs/1801.08586 (2018) - [i7]Polina Rozenshtein, Francesco Bonchi, Aristides Gionis, Mauro Sozio, Nikolaj Tatti:
Finding events in temporal networks: Segmentation meets densest-subgraph discovery. CoRR abs/1808.09317 (2018) - 2017
- [j23]Orestis Kostakis, Nikolaj Tatti, Aristides Gionis:
Discovering recurring activity in temporal networks. Data Min. Knowl. Discov. 31(6): 1840-1871 (2017) - [j22]Polina Rozenshtein, Nikolaj Tatti, Aristides Gionis:
Finding Dynamic Dense Subgraphs. ACM Trans. Knowl. Discov. Data 11(3): 27:1-27:30 (2017) - [c31]Polina Rozenshtein, Nikolaj Tatti, Aristides Gionis:
Inferring the Strength of Social Ties: A Community-Driven Approach. KDD 2017: 1017-1025 - [c30]Kiran Garimella, Aristides Gionis, Nikos Parotsidis, Nikolaj Tatti:
Balancing information exposure in social networks. NIPS 2017: 4663-4671 - [c29]Polina Rozenshtein, Nikolaj Tatti, Aristides Gionis:
The Network-Untangling Problem: From Interactions to Activity Timelines. ECML/PKDD (1) 2017: 701-716 - [c28]Aristides Gionis, Polina Rozenshtein, Nikolaj Tatti, Evimaria Terzi:
Community-aware network sparsification. SDM 2017: 426-434 - [i6]Aristides Gionis, Polina Rozenshtein, Nikolaj Tatti, Evimaria Terzi:
Community-aware network sparsification. CoRR abs/1701.07221 (2017) - [i5]Kiran Garimella, Aristides Gionis, Nikos Parotsidis, Nikolaj Tatti:
Balancing Information Exposure in Social Networks. CoRR abs/1709.01491 (2017) - 2016
- [j20]Esther Galbrun, Aristides Gionis, Nikolaj Tatti:
Top-k overlapping densest subgraphs. Data Min. Knowl. Discov. 30(5): 1134-1165 (2016) - [c26]Albert Arockiasamy, Aristides Gionis, Nikolaj Tatti:
A Combinatorial Approach to Role Discovery. ICDM 2016: 787-792 - 2015
- [j19]Eric Malmi, Nikolaj Tatti, Aristides Gionis:
Beyond rankings: comparing directed acyclic graphs. Data Min. Knowl. Discov. 29(5): 1233-1257 (2015) - [c24]Rohit Kumar, Toon Calders, Aristides Gionis, Nikolaj Tatti:
Maintaining Sliding-Window Neighborhood Profiles in Interaction Networks. ECML/PKDD (2) 2015: 719-735 - [c23]Nikolaj Tatti, Aristides Gionis:
Density-friendly Graph Decomposition. WWW 2015: 1089-1099 - 2014
- [j14]Esther Galbrun, Aristides Gionis, Nikolaj Tatti:
Overlapping community detection in labeled graphs. Data Min. Knowl. Discov. 28(5-6): 1586-1610 (2014) - [c22]Polina Rozenshtein, Aris Anagnostopoulos, Aristides Gionis, Nikolaj Tatti:
Event detection in activity networks. KDD 2014: 1176-1185 - [c20]Polina Rozenshtein, Nikolaj Tatti, Aristides Gionis:
Discovering Dynamic Communities in Interaction Networks. ECML/PKDD (2) 2014: 678-693 - 2013
- [c18]Nikolaj Tatti, Aristides Gionis:
Discovering Nested Communities. ECML/PKDD (2) 2013: 32-47 - 2006
- [c1]Nikolaj Tatti, Taneli Mielikäinen, Aristides Gionis, Heikki Mannila:
What is the Dimension of Your Binary Data? ICDM 2006: 603-612
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 01:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint