Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Konstantin Kutzkov"'
Autor:
George Tzougas, Konstantin Kutzkov
Publikováno v:
Algorithms, Vol 16, Iss 2, p 99 (2023)
We developed a methodology for the neural network boosting of logistic regression aimed at learning an additional model structure from the data. In particular, we constructed two classes of neural network-based models: shallow–dense neural networks
Externí odkaz:
https://doaj.org/article/71c8bd1930db49d4a1aec23533ccfa15
Publikováno v:
Anales del Instituto de Actuarios Españoles. :149-168
The aim of this paper is to implement, one of the most representative supervised learning approaches, the decision tree based ensemble method called gradient boosting for classifying the number of claims caused by storms in Greece using data from a m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c16693c7ce0987c573f557e7b8593ad0
https://doi.org/10.26360/2022_6
https://doi.org/10.26360/2022_6
Publikováno v:
WWW
Correlation clustering is arguably the most natural formulation of clustering. Given n objects and a pairwise similarity measure, the goal is to cluster the objects so that, to the best possible extent, similar objects are put in the same cluster and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a465af625514cc00c19fdbe368cd57f2
https://doi.org/10.1145/3366423.3380220
https://doi.org/10.1145/3366423.3380220
Publikováno v:
Algorithmica
Algorithmica, Springer Verlag, 2016, 76 (1), pp.259-278. ⟨10.1007/s00453-015-0036-4⟩
Bulteau, L, Froese, V, Pagh, R & Kutzkov, K 2015, ' Triangle Counting in Dynamic Graph Streams ', Algorithmica . https://doi.org/10.1007/s00453-015-0036-4
Algorithmica, Springer Verlag, 2016, 76 (1), pp.259-278. ⟨10.1007/s00453-015-0036-4⟩
Bulteau, L, Froese, V, Pagh, R & Kutzkov, K 2015, ' Triangle Counting in Dynamic Graph Streams ', Algorithmica . https://doi.org/10.1007/s00453-015-0036-4
Estimating the number of triangles in graph streams using a limited amount of memory has become a popular topic in the last decade. Different variations of the problem have been studied, depending on whether the graph edges are provided in an arbitra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bfa1c8db43b271d9004d448f30982d2c
https://doi.org/10.1007/s00453-015-0036-4
https://doi.org/10.1007/s00453-015-0036-4
Autor:
Alexander Golovnev, Konstantin Kutzkov
Publikováno v:
Theoretical Computer Science. 526:18-27
Many optimization problems can be phrased in terms of constraint satisfaction. In particular MAX-2-SAT and MAX-2-CSP are known to generalize many hard combinatorial problems on graphs. Algorithms solving the problem exactly have been designed but the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ddfab2fa9efadfb4a61932bb926bfa56
https://doi.org/10.1016/j.tcs.2014.01.010
https://doi.org/10.1016/j.tcs.2014.01.010
Autor:
Konstantin Kutzkov
Publikováno v:
Information Processing Letters. 112:535-539
We present a simple exact algorithm for counting bicliques of given size in a bipartite graph on n vertices. We achieve running time of O(1.2491^n), improving upon known exact algorithms for finding and counting bipartite cliques.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::943841e892cc8a112c1603060a1a0c72
https://doi.org/10.1016/j.ipl.2012.04.001
https://doi.org/10.1016/j.ipl.2012.04.001
Autor:
Konstantin Kutzkov
Publikováno v:
Information Processing Letters. 105:1-5
We present a new deterministic algorithm for the #3-SAT problem, based on the DPLL strategy. It uses a new approach for counting models of instances with low density. This allows us to assume the adding of more 2-clauses than in previous algorithms.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f1921db6f9d0ca242b4d3119a7537711
https://doi.org/10.1016/j.ipl.2007.06.017
https://doi.org/10.1016/j.ipl.2007.06.017
Publikováno v:
CIKM
Similarity computation between pairs of objects is often a bottleneck in many applications that have to deal with massive volumes of data. Motivated by applications such as collaborative filtering in large-scale recommender systems, and influence pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::04e006795a9ac99eb4b49bc3eda64e14
https://doi.org/10.1145/2806416.2806515
https://doi.org/10.1145/2806416.2806515
Publikováno v:
Proceedings of the 2014 SIAM International Conference on Data Mining.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8e823f86955f9cd750521dcc3b30bd1e
https://doi.org/10.1137/1.9781611973440.40
https://doi.org/10.1137/1.9781611973440.40
Autor:
Konstantin Kutzkov
Publikováno v:
Journal on Satisfiability, Boolean Modeling and Computation. 1:143-145
An independent set of variables is one in which no two variables occur in the same clause in a given k-SAT instance. Recently, independent sets have obtained more attention. Due to a simple observation we prove that a k-SAT instance over n variables
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1b5a3da2bc293c7d38308d736c615fb4
https://doi.org/10.3233/sat190007
https://doi.org/10.3233/sat190007