default search action
Piotr Lasek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
2010 – 2019
- 2019
- [j4]Piotr Lasek
, Jarek Gryz:
Density-based clustering with constraints. Comput. Sci. Inf. Syst. 16(2): 469-489 (2019) - [c16]Piotr Lasek
Clustering and visualization of a high-dimensional diabetes dataset. KES 2019: 2179-2188 - 2016
- [j3]Zbigniew Suraj
Inverted Fuzzy Implications in Approximate Reasoning. Fundam. Informaticae 143(1-2): 151-171 (2016) - [j2]Parke Godfrey, Jarek Gryz, Piotr Lasek
Interactive Visualization of Large Data Sets. IEEE Trans. Knowl. Data Eng. 28(8): 2142-2157 (2016) - [c15]Parke Godfrey, Jarek Gryz, Piotr Lasek, Nasim Razavi:
Interactive Visualization of Big Data. BDAS 2016: 3-22 - [c14]Parke Godfrey, Jarek Gryz, Piotr Lasek, Nasim Razavi:
Visualization Through Inductive Aggregation. EDBT 2016: 600-603 - 2015
- [c13]Piotr Lasek:
Instance-Level Constraints in Density-Based Clustering. CS&P 2015: 11-18 - [c12]Jarek Gryz, Parke Godfrey, Piotr Lasek, Nasim Razavi:
Skydive: An interactive data visualization engine. LDAV 2015: 129-130 - 2014
- [c11]Piotr Lasek:
C-NBC: Neighborhood-Based Clustering with Constraints. CS&P 2014: 113-120 - [c10]Piotr Lasek, Krzysztof Lasek:
Relative Constraints as Features. CS&P 2014: 121-125 - [c9]Zbigniew Suraj, Agnieszka Lasek, Piotr Lasek:
Inverted Fuzzy Implications in Approximate Reasoning. CS&P 2014: 237-244 - [c8]Piotr Lasek:
CDM: A Prototype Implementation of the Data Mining JDM Standard. DepCoS-RELCOMEX 2014: 303-311 - [c7]Piotr Lasek:
Erratum: CDM: A Prototype Implementation of the Data Mining JDM Standard. DepCoS-RELCOMEX 2014 - 2013
- [c6]Piotr Lasek:
The LVA-Index in Clustering. DepCoS-RELCOMEX 2013: 275-283 - [c5]Piotr Lasek:
An Extended Version of the LVA-Index. IDEAL 2013: 126-133 - 2010
- [c4]Marzena Kryszkiewicz, Piotr Lasek:
A Neighborhood-Based Clustering by Means of the Triangle Inequality. IDEAL 2010: 284-291 - [c3]Marzena Kryszkiewicz, Piotr Lasek:
TI-DBSCAN: Clustering with DBSCAN by Means of the Triangle Inequality. RSCTC 2010: 60-69
2000 – 2009
- 2009
- [c2]Piotr Lasek:
LVA-Index: An Efficient Way to Determine Nearest Neighbors. ICMMI 2009: 623-633 - 2008
- [j1]Marzena Kryszkiewicz, Piotr Lasek:
FUN: Fast Discovery of Minimal Sets of Attributes Functionally Determining a Decision Attribute. Trans. Rough Sets 9: 76-95 (2008) - 2007
- [c1]Marzena Kryszkiewicz, Piotr Lasek:
Fast Discovery of Minimal Sets of Attributes Functionally Determining a Decision Attribute. RSEISP 2007: 320-331
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-04-25 05:51 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: