1 citations · 2 across the 8 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2026
Incremental Graph Construction Enables Robust Spectral Clustering of Texts
Marko Pranjić, Boshko Koloski, Nada Lavrač +2
Neighborhood graphs are a critical but often fragile step in spectral clustering of text embeddings. On realistic text datasets, standard -NN graphs can contain many disconnecte…
cs.LG2025
HorNets: Learning from Discrete and Continuous Signals with Routing Neural Networks
Boshko Koloski, Nada Lavrač, Blaž Škrlj
Construction of neural network architectures suitable for learning from both continuous and discrete tabular data is a challenging research endeavor. Contemporary high-dimensional…