One-class support vector classifiers: A survey
S Alam, SK Sonbhadra, S Agarwal… - Knowledge-Based …, 2020 - Elsevier
Over the past two decades, one-class classification (OCC) becomes very popular due to its
diversified applicability in data mining and pattern recognition problems. Concerning to …
diversified applicability in data mining and pattern recognition problems. Concerning to …
The topology of fullerenes
P Schwerdtfeger, LN Wirz… - Wiley Interdisciplinary …, 2015 - Wiley Online Library
Fullerenes are carbon molecules that form polyhedral cages. Their bond structures are
exactly the planar cubic graphs that have only pentagon and hexagon faces. Strikingly, a …
exactly the planar cubic graphs that have only pentagon and hexagon faces. Strikingly, a …
The anatomy of the 2016 South Australia blackout: A catastrophic event in a high renewable network
Over the last decade, many power systems have significantly changed with the proliferation
of renewable generation sources, such as wind and solar photovoltaic. Due to their …
of renewable generation sources, such as wind and solar photovoltaic. Due to their …
Adapting to misspecification in contextual bandits
A major research direction in contextual bandits is to develop algorithms that are
computationally efficient, yet support flexible, general-purpose function approximation …
computationally efficient, yet support flexible, general-purpose function approximation …
[PDF][PDF] Geometric approximation via coresets
The paradigm of coresets has recently emerged as a powerful tool for efficiently
approximating various extent measures of a point set P. Using this paradigm, one quickly …
approximating various extent measures of a point set P. Using this paradigm, one quickly …
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
KL Clarkson - ACM Transactions on Algorithms (TALG), 2010 - dl.acm.org
The problem of maximizing a concave function f (x) in the unit simplex Δ can be solved
approximately by a simple greedy algorithm. For given k, the algorithm can find a point x (k) …
approximately by a simple greedy algorithm. For given k, the algorithm can find a point x (k) …
[图书][B] Sentic computing: Techniques, tools, and applications
In this book common sense computing techniques are further developed and applied to
bridge the semantic gap between word-level natural language data and the concept-level …
bridge the semantic gap between word-level natural language data and the concept-level …
Approximating extent measures of points
We present a general technique for approximating various descriptors of the extent of a set P
of n points in R d when the dimension d is an arbitrary fixed constant. For a given extent …
of n points in R d when the dimension d is an arbitrary fixed constant. For a given extent …
Efficient inverse maintenance and faster algorithms for linear programming
In this paper, we consider the following inverse maintenance problem: given A∈ R n× d and
a number of rounds r, at round k, we receive anxn diagonal matrix D (k) and we wish to …
a number of rounds r, at round k, we receive anxn diagonal matrix D (k) and we wish to …
Data-driven risk-averse two-stage optimal stochastic scheduling of energy and reserve with correlated wind power
This paper proposes a data-driven optimization method to solve the integrated energy and
reserve dispatch problem with variable and correlated renewable energy generation. The …
reserve dispatch problem with variable and correlated renewable energy generation. The …