default search action
Robert A. Klopotek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j7]Mieczyslaw A. Klopotek
, Robert A. Klopotek
Towards continuous consistency axiom. Appl. Intell. 53(5): 5635-5663 (2023) - [j6]Mieczyslaw Alojzy Klopotek
On the Discrepancy between Kleinberg's Clustering Axioms and k-Means Clustering Algorithm Behavior. Mach. Learn. 112(7): 2501-2553 (2023) - 2022
- [j5]Mieczyslaw A. Klopotek
Network Capacity Bound for Personalized PageRank in Multimodal Networks. Fundam. Informaticae 189(1): 49-68 (2022) - [c9]Mieczyslaw A. Klopotek
Richness Fallacy. ISMIS 2022: 262-271 - [i5]Mieczyslaw A. Klopotek, Robert A. Klopotek:
Towards Continuous Consistency Axiom. CoRR abs/2202.06015 (2022) - [i4]Mieczyslaw A. Klopotek, Robert A. Klopotek
How To Overcome Richness Axiom Fallacy. CoRR abs/2210.15507 (2022) - 2021
- [j4]Mieczyslaw A. Klopotek
Issues in clustering algorithm consistency in fixed dimensional spaces. Some solutions for k-means. J. Intell. Inf. Syst. 57(3): 509-530 (2021) - 2020
- [j3]Robert A. Klopotek
A feasible k-means kernel trick under non-Euclidean feature space. Int. J. Appl. Math. Comput. Sci. 30(4): 703-715 (2020) - [j2]Robert A. Klopotek
Modeling Bimodal Social Networks Subject to the Recommendation with the Cold Start User-Item Model. Comput. 9(1): 11 (2020) - [c8]Mieczyslaw A. Klopotek
In-The-Limit Clustering Axioms. ICAISC (2) 2020: 199-209 - [c7]Mieczyslaw A. Klopotek, Slawomir T. Wierzchon
k-means Cluster Shape Implications. AIAI (1) 2020: 107-118 - [c6]Mieczyslaw Alojzy Klopotek
Clustering Algorithm Consistency in Fixed Dimensional Spaces. ISMIS 2020: 352-361
2010 – 2019
- 2019
- [c5]Robert A. Klopotek
Traditional PageRank Versus Network Capacity Bound. ADMA 2019: 236-249 - [c4]Robert Albert Klopotek
Modeling Bimodal Social Networks Subject to Recommendation. ICIST 2019: 121-135 - [c3]Robert A. Klopotek
On Probabilistic k-Richness of the k-Means Algorithms. LOD 2019: 259-271 - 2017
- [i3]Mieczyslaw A. Klopotek, Slawomir T. Wierzchon, Robert A. Klopotek
Traditional PageRank versus Network Capacity Bound. CoRR abs/1702.03734 (2017) - [i2]Robert A. Klopotek
On the Discrepancy Between Kleinberg's Clustering Axioms and k-Means Clustering Algorithm Behavior. CoRR abs/1702.04577 (2017) - [i1]Mieczyslaw A. Klopotek, Slawomir T. Wierzchon, Robert A. Klopotek
Network Capacity Bound for Personalized PageRank in Multimodal Networks. CoRR abs/1706.00178 (2017) - 2016
- [j1]Pawel Teisseyre
Random Subspace Method for high-dimensional regression with the R package regRSM. Comput. Stat. 31(3): 943-972 (2016) - [p1]Mieczyslaw A. Klopotek, Slawomir T. Wierzchon
Network Capacity Bound for Personalized Bipartite PageRank. Challenges in Computational Statistics and Data Mining 2016: 189-204 - 2013
- [c2]Robert A. Klopotek
Study on the Estimation of the Bipartite Graph Generator Parameters. IIS 2013: 234-244 - 2012
- [c1]Robert A. Klopotek, Joanna Porter-Sobieraj:
Solving Systems of Polynomial Equations on a GPU. FedCSIS 2012: 539-544
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: