arXiv subjects

Lina Stankovic

Publications and source records attributed to Lina Stankovic.

6 recordsLinked to original sources

arXiv2026

Public EV Charging Choices: How Users Trade Off Time, Price, and Renewable Energy

The carbon intensity of electric-vehicle (EV) charging varies over time and place, yet EV charging recommender systems and eco-routing interfaces rarely make this variation actionable for drivers. We investigate how renewable-energy information interacts with two attributes that routinely shape public-charging decisions: travel time and price. Fifty car users completed a within-subjects stated-choice study with three navigation-interface variants, and 10 EV drivers participated in semi-structured interviews. Across the three variants, the share choosing the slower option was 38%, 42%, and 66%, respectively. A paired-sample analysis found that choices differed across variants (Cochran's Q(2) = 11.47, p = .003). When the time-price trade-off was held constant, adding a renewable-energy label increased selection of the slower station from 38% to 66% (exact McNemar test, Holm-adjusted p = .004). Interviews nevertheless showed that renewable energy was usually a secondary consideration: participants evaluated it through situational constraints such as urgency, charging cost, traffic, charger availability, and familiarity with locations. We derive a constraint-first design rationale for renewable-energy-aware charging recommendations: filter options using context-sensitive time and cost constraints, disclose the renewable-energy signal and its uncertainty, and preserve user control rather than relying on a green default alone. Together, the results provide an empirical baseline for research on green charging recommendations, while characterizing stated choices in a small exploratory sample rather than real-world charging behavior.

cs.HC↗

arXiv2026

Classifying bioacoustic data without individual call annotations using temporal convolutional networks and feature extractors

Bioacoustic data from Passive Acoustic Monitoring (PAM) generates large datasets where obtaining detailed auditing and labelling is often impractical, resulting in weak annotations (e.g., presence/absence of species over several minutes of recording). In order to effectively capture the complex temporal patterns and key features of long audio segments, we propose a framework comprising dataset standardisation, feature extraction, and classification via Temporal Convolutional Networks (TCN). This approach eliminates the necessity for setting heuristic decision rules or creating time-consuming strong labels. To demonstrate the effectiveness of our approach, we use sperm whale (\textit{Physeter macrocephalus}) click trains in 4-minute recordings as a case study, from a dataset comprising diverse sources and deployment conditions to maximise generalisability. Our TCN classifiers achieve recall rates exceeding 0.83 at a 0.13 false positive rate, comparable to agreement rates between expert annotators. We compare two methods of feature extraction, Variational AutoEncoders (VAEs) and traditional handpicking of features, and found them to yield similar performance results, with the VAE-based classifiers seeing a more stable performance across datasets and recording conditions. These results offer a way forward in leveraging numerous existing annotated bioacoustic datasets to train automatic classification models, effectively overcoming previous limitations associated with weak labels.

cs.SD↗

arXiv2021

How likely is a random graph shift-enabled?

The shift-enabled property of an underlying graph is essential in designing distributed filters. This article discusses when a random graph is shift-enabled. In particular, popular graph models ER, WS, BA random graph are used, weighted and unweighted, as well as signed graphs. Our results show that the considered unweighted connected random graphs are shift-enabled with high probability when the number of edges is moderately high. However, very dense graphs, as well as fully connected graphs, are not shift-enabled. Interestingly, this behaviour is not observed for weighted connected graphs, which are always shift-enabled unless the number of edges in the graph is very low.

cs.DM↗

arXiv2019

Robust Deep Graph Based Learning for Binary Classification

Convolutional neural network (CNN)-based feature learning has become state of the art, since given sufficient training data, CNN can significantly outperform traditional methods for various classification tasks. However, feature learning becomes more difficult if some training labels are noisy. With traditional regularization techniques, CNN often overfits to the noisy training labels, resulting in sub-par classification performance. In this paper, we propose a robust binary classifier, based on CNNs, to learn deep metric functions, which are then used to construct an optimal underlying graph structure used to clean noisy labels via graph Laplacian regularization (GLR). GLR is posed as a convex maximum a posteriori (MAP) problem solved via convex quadratic programming (QP). To penalize samples around the decision boundary, we propose two regularized loss functions for semi-supervised learning. The binary classification experiments on three datasets, varying in number and type of features, demonstrate that given a noisy training dataset, our proposed networks outperform several state-of-the-art classifiers, including label-noise robust support vector machine, CNNs with three different robust loss functions, model-based GLR, and dynamic graph CNN classifiers.

cs.LG↗

arXiv2019

Undirected graphs: is the shift-enabled condition trivial or necessary?

It has recently been shown that, contrary to the wide belief that a shift-enabled condition (necessary for any shift-invariant filter to be representable by a graph shift matrix) can be ignored because any non-shift-enabled matrix can be converted to a shift-enabled matrix, such a conversion in general may not hold for a directed graph with non-symmetric shift matrix. This letter extends this prior work, focusing on undirected graphs where the shift matrix is generally symmetric. We show that while, in this case, the shift matrix can be converted to satisfy the original shift-enabled condition, the converted matrix is not associated with the original graph, that is, it does not capture anymore the structure of the graph signal. We show via a counterexample, that a non-shift-enabled matrix cannot be converted to a shift-enabled one and still maintain the topological structure of the underlying graph, which is necessary to facilitate localized signal processing.

eess.SP↗

arXiv2018

Shift-enabled graphs: Graphs where shift-invariant filters are representable as polynomials of shift operations

In digital signal processing, shift-invariant filters can be represented as a polynomial expansion of a shift operation,that is, the Z-transform representation. When extended to graph signal processing (GSP), this would mean that a shift-invariant graph filter can be represented as a polynomial of the adjacency (shift) matrix of the graph. However, the characteristic and minimum polynomials of the adjacency matrix must be identical for the property to hold. While it has been suggested that this condition might be ignored as it is always possible to find a polynomial transform to represent the original adjacency matrix by another adjacency matrix that satisfies the condition, this letter shows that a filter that is shift invariant in terms of the original graph may not be shift invariant anymore under the modified graph and vice versa. We introduce the notion of "shift-enabled graph" for graphs that satisfy the aforementioned condition, and present a concrete example of a graph that is not "shift-enabled" and a shift-invariant filter that is not a polynomial of the shift operation matrix. The result provides a deeper understanding of shift-invariant filters when applied in GSP and shows that further investigation of shift-enabled graphs is needed to make it applicable to practical scenarios.

eess.SP↗