Demo Data from EDBT 2026 / reviewers in the wild / expert
Arie Croitoru
dblp:58/6420
· DBLP profile ↗
6ranked-venue papers
2as first author
1since 2021 · last 2023
0000-0002-8470-9273ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 4 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 1 first-author · 1 since 2021Artificial intelligence and machine learning · 1
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.
| Theoretical computer science
1 paper |
Graph algorithms and graph theory · 100% | |
| Artificial intelligence
1 paper |
Trustworthy machine learning · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Data mining · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning
fairness |
0.7 | 1 | 2023 | Fairness-Aware Clique-Preserving Spectral Clustering of Temporal Graphs · WWW 2023 |
Graph algorithms and graph theory
graph clustering |
0.7 | 1 | 2023 | Fairness-Aware Clique-Preserving Spectral Clustering of Temporal Graphs · WWW 2023 |
Graph algorithms and graph theory › graph clustering
spectral clustering |
0.7 | 1 | 2023 | Fairness-Aware Clique-Preserving Spectral Clustering of Temporal Graphs · WWW 2023 |
Data mining
pattern mining |
0.2 | 1 | 2023 | Fairness-Aware Clique-Preserving Spectral Clustering of Temporal Graphs · WWW 2023 |
Methods — techniques the papers use, named apart from their topics
spectral methods · 2.0laplacian update · 2.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Fairness-Aware Clique-Preserving Spectral Clustering of Temporal GraphsabstractWith the widespread development of algorithmic fairness, there has been a surge of research interest that aims to generalize the fairness notions from the attributed data to the relational data (graphs). The vast majority of existing work considers the fairness measure in terms of the low-order connectivity patterns (e.g., edges), while overlooking the higher-order patterns (e.g., k-cliques) and the dynamic nature of real-world graphs. For example, preserving triangles from graph cuts during clustering is the key to detecting compact communities; however, if the clustering algorithm only pays attention to triangle-based compactness, then the returned communities lose the fairness guarantee for each group in the graph. Furthermore, in practice, when the graph (e.g., social networks) topology constantly changes over time, one natural question is how can we ensure the compactness and demographic parity at each timestamp efficiently. To address these problems, we start from the static setting and propose a spectral method that preserves clique connections and incorporates demographic fairness constraints in returned clusters at the same time. To make this static method fit for the dynamic setting, we propose two core techniques, Laplacian Update via Edge Filtering and Searching and Eigen-Pairs Update with Singularity Avoided. Finally, all proposed components are combined into an end-to-end clustering framework named F-SEGA, and we conduct extensive experiments to demonstrate the effectiveness, efficiency, and robustness of F-SEGA. Dongqi Fu, Dawei Zhou 0003, Ross Maciejewski, Arie Croitoru, Marcus Boyd, Jingrui He |
WWW | 4 |
| 2017 | Predicting the Evolution of Narratives in Social Media
Klaus Arthur Schmid, Andreas Züfle, Dieter Pfoser, Andrew T. Crooks, Arie Croitoru, Anthony Stefanidis |
SSTD | 5 |
| 2015 | Crowdsourcing urban form and functionabstractUrban form and function have been studied extensively in urban planning and geographical information science. However, gaining a greater understanding of how they merge to define the urban morphology remains a substantial scientific challenge. Toward this goal, this paper addresses the opportunities presented by the emergence of crowdsourced data to gain novel insights into form and function in urban spaces. We are focusing in particular on information harvested from social media and other open-source and volunteered datasets (e.g. trajectory and OpenStreetMap data). These data provide a first-hand account of form and function from the people who define urban space through their activities. This novel bottom-up approach to study these concepts complements traditional urban studies to provide a new lens for studying urban activity. By synthesizing recent advancements in the analysis of open-source data, we provide a new typology for characterizing the role of crowdsourcing in the study of urban morphology. We illustrate this new perspective by showing how social media, trajectory, and traffic data can be analyzed to capture the evolving nature of a city’s form and function. While these crowd contributions may be explicit or implicit in nature, they are giving rise to an emerging research agenda for monitoring, analyzing, and modeling form and function for urban design and analysis. Andrew T. Crooks, Dieter Pfoser, Andrew Jenkins, Arie Croitoru, Anthony Stefanidis, Duncan Smith, Sophia Karagiorgou, Alexandros Efentakis, George Lamprianidis |
Int. J. Geogr. Inf. Sci. | 4 |
| 2013 | Geosocial gauge: a system prototype for knowledge discovery from social mediaabstractThe remarkable success of online social media sites marks a shift in the way people connect and share information. Much of this information now contains some form of geographical content because of the proliferation of location-aware devices, thus fostering the emergence of geosocial media – a new type of user-generated geospatial information. Through geosocial media we are able, for the first time, to observe human activities in scales and resolutions that were so far unavailable. Furthermore, the wide spectrum of social media data and service types provides a multitude of perspectives on real-world activities and happenings, thus opening new frontiers in geosocial knowledge discovery. However, gleaning knowledge from geosocial media is a challenging task, as they tend to be unstructured and thematically diverse. To address these challenges, this article presents a system prototype for harvesting, processing, modeling, and integrating heterogeneous social media feeds towards the generation of geosocial knowledge. Our article addresses primarily two key components of this system prototype: a novel data model for heterogeneous social media feeds and a corresponding general system architecture. We present these key components and demonstrate their implementation in our system prototype, GeoSocial Gauge. Arie Croitoru, Andrew T. Crooks, Jacek Radzikowski, Anthony Stefanidis |
Int. J. Geogr. Inf. Sci. | 1 |
| 2008 | Deriving and Mining Spatiotemporal Event Schemas in In-Situ Sensor Data
Arie Croitoru |
ICCSA (1) | 1 |
| 2007 | Image-to-X Registration using Linear FeaturesabstractThe registration of imagery to maps and GIS layers is a fundamental operation for the management of spatial data in GIS. This paper introduces automated algorithms for the registration of sequences of aerial imagery to vector map data using linear features (primarily roads) as control information. Our algorithms support both the use of single elements as well as complete networks. Regarding single elements, our method is based on the extraction of linear features using active contour models (a.k.a. snakes), followed by the construction of a polygonal template upon which a matching process is applied. To accommodate more robust matching, this work presents both exact and inexact matching schemes for linear features. Additionally, in order to overcome the influence of the snakes-based extraction process on the matching results, a matching refinement process is suggested. This information is used to generate image mosaics and register these mosaics to a map. The performance of the proposed scheme was tested on sequences of aerial imagery of 1 m resolution that were subjected to shifts and rotations using both the exact and inexact matching scheme, and was shown to produce angular accuracies of less than 0.7 degrees and positional accuracies of less than 2 pixels. Arie Croitoru, Anthony Stefanidis, Peggy Agouris |
FUZZ-IEEE | 2 |