default search action
Dora Souliou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j4]Konstantinos Sismanis, Petros Potikas, Dora Souliou, Aris Pagourtzis:
Overlapping community detection using graph attention networks. Future Gener. Comput. Syst. 163: 107529 (2025) - 2022
- [c11]Petros Potikas, Dora Souliou, Aris Pagourtzis, Katerina Potika:
A parallel community detection algorithm based on spanning trees. BigDataService 2022: 61-65 - 2020
- [c10]Aris Pagourtzis, Dora Souliou, Petros Potikas, Katerina Potika:
Overlapping Community Detection via Minimum Spanning Tree Computations. BigDataService 2020: 62-65
2010 – 2019
- 2019
- [c9]Dora Souliou, Petros Potikas, Katerina Potika, Aris Pagourtzis:
Weight assignment on edges towards improved community detection. IDEAS 2019: 3:1-3:5 - 2018
- [c8]Ketki Kulkarni, Aris Pagourtzis, Katerina Potika, Petros Potikas, Dora Souliou:
Community Detection via Neighborhood Overlap and Spanning Tree Computations. ALGOCLOUD 2018: 13-24 - 2014
- [j3]Tatiana Tambouratzis, Dora Souliou, Miltiadis S. Chalikias, Andreas Gregoriades:
Maximising Accuracy and Efficiency of Traffic Accident Prediction Combining Information Mining with Computational Intelligence Approaches and Decision Trees. J. Artif. Intell. Soft Comput. Res. 4(1): 31-42 (2014) - 2010
- [c7]Tatiana Tambouratzis, Dora Souliou, Miltiadis S. Chalikias, Andreas Gregoriades:
Combining probabilistic neural networks and decision trees for maximally accurate and efficient accident prediction. IJCNN 2010: 1-8 - [c6]Tatiana Tambouratzis, Miltiadis S. Chalikias, Dora Souliou, Andreas Gregoriades:
Dimensionality Reduction of Accident Databases for Minimal Tradeoff in Prediction Accuracy. IKE 2010: 64-71 - [c5]Victor Kyritsis, Paraskevas V. Lekeas, Dora Souliou, Foto N. Afrati:
A New Framework for Join Product Skew. RED 2010: 1-10 - [i1]Foto N. Afrati, Victor Kyritsis, Paraskevas V. Lekeas, Dora Souliou:
A New Framework for Join Product Skew. CoRR abs/1005.5732 (2010)
2000 – 2009
- 2009
- [j2]Frans Coenen, Paul H. Leng, Aris Pagourtzis, Wojciech Rytter, Dora Souliou:
Improved methods for extracting frequent itemsets from interim-support trees. Softw. Pract. Exp. 39(6): 551-571 (2009) - [c4]Yannis Delveroudis, Paraskevas V. Lekeas, Dora Souliou:
On Estimating Semantic Loss in Peer Data Management Systems. AP2PS 2009: 51-53 - 2007
- [c3]Dora Souliou, Aris Pagourtzis, Panayotis Tsanakas:
A fast parallel algorithm for frequent itemsets mining. AIAI 2007: 213-220 - 2006
- [j1]Dora Souliou, Aris Pagourtzis, Nikolaos Drosinos, Panayotis Tsanakas:
Computing frequent itemsets in parallel using partial support trees. J. Syst. Softw. 79(12): 1735-1743 (2006) - 2005
- [c2]Dora Souliou, Aris Pagourtzis, Nikolaos Drosinos:
Computing Frequent Itemsets in Parallel Using Partial Support Trees. PVM/MPI 2005: 28-37 - [c1]Frans Coenen, Paul H. Leng, Aris Pagourtzis, Wojciech Rytter, Dora Souliou:
Improved Methods for Extracting Frequent Itemsets from Interim-Support Trees. SGAI Conf. 2005: 263-276
Coauthor Index
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-10-07 22:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint