Multimodal dual-embedding networks for malware open-set recognition

J Guo, H Wang, Y Xu, W Xu, Y Zhan… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
Malware open-set recognition (MOSR) is an emerging research domain that aims at jointly
classifying malware samples from known families and detecting the ones from novel …

Mdenet: multi-modal dual-embedding networks for malware open-set recognition

J Guo, Y Xu, W Xu, Y Zhan, Y Sun, S Guo - arxiv preprint arxiv …, 2023 - arxiv.org
Malware open-set recognition (MOSR) aims at jointly classifying malware samples from
known families and detect the ones from novel unknown families, respectively. Existing …

Sliding window algorithms for k-clustering problems

M Borassi, A Epasto, S Lattanzi… - Advances in …, 2020 - proceedings.neurips.cc
The sliding window model of computation captures scenarios in which data is arriving
continuously, but only the latest $ w $ elements should be used for analysis. The goal is to …

Minimum coresets for maxima representation of multidimensional data

Y Wang, M Mathioudakis, Y Li, KL Tan - Proceedings of the 40th ACM …, 2021 - dl.acm.org
Coresets are succinct summaries of large datasets such that, for a given problem, the
solution obtained from a coreset is provably competitive with the solution obtained from the …

A fully dynamic algorithm for k-regret minimizing sets

Y Wang, Y Li, RCW Wong… - 2021 IEEE 37th …, 2021 - ieeexplore.ieee.org
Selecting a small set of representatives from a large database is important in many
applications such as multi-criteria decision making, web search, and recommendation. The k …

Adaptive k-center and diameter estimation in sliding windows

P Pellizzoni, A Pietracaprina, G Pucci - International Journal of Data …, 2022 - Springer
In this paper we present novel streaming algorithms for the k-center and the diameter
estimation problems for general metric spaces under the sliding window model. The key …

Reactive concept drift detection using coresets over sliding windows

M Heusinger, FM Schleif - 2020 IEEE Symposium Series on …, 2020 - ieeexplore.ieee.org
The change of underlying data is one of the biggest challenges in non-stationary
environments. While several algorithms have been proposed to detect these changes …

Improved weighted matching in the sliding window model

CM Alexandru, P Dvořák, C Konrad… - arxiv preprint arxiv …, 2022 - arxiv.org
We consider the Maximum-weight Matching (MWM) problem in the streaming sliding
window model of computation. In this model, the input consists of a sequence of weighted …

Learning with high dimensional data and preprocessing in non-stationary environments

M Heusinger - 2023 - pub.uni-bielefeld.de
The internet of things generates huge amounts of multidimensional sensor readings. The
analysis of these high dimensional data is chal-lenging and not sufficiently addressed. In …

Simple and Efficient Acceleration of the Smallest Enclosing Ball for Large Data Sets in : Analysis and Comparative Results

V Skala, M Cerny, JY Saleh - International Conference on Computational …, 2022 - Springer
Finding the smallest enclosing circle of the given points in E 2 is a seemingly simple
problem. However, already proposed algorithms have high memory requirements or require …