Tadeusz Lasota

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Tomasz Luczak 0002

> Home > Persons > Tadeusz Lasota

Publications

2013
[c36]
- view
  authority control:
- export record
  dblp key:
  - conf/iccci/LasotaLNOT13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iccci/LasotaLNOT13
Tadeusz Lasota, Tomasz Luczak, Michal Niemczyk, Michal Olszewski, Bogdan Trawinski:
Investigation of Property Valuation Models Based on Decision Tree Ensembles Built over Noised Data. ICCCI 2013: 417-426
2012
[c34]
- view
  authority control:
- export record
  dblp key:
  - conf/icaisc/LasotaLT12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icaisc/LasotaLT12
Tadeusz Lasota, Tomasz Luczak, Bogdan Trawinski:
Investigation of Rotation Forest Method Applied to Property Price Prediction. ICAISC (1) 2012: 403-411
2011
[c24]
- view
  authority control:
- export record
  dblp key:
  - conf/iccci/LasotaLT11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iccci/LasotaLT11
Tadeusz Lasota, Tomasz Luczak, Bogdan Trawinski:
Investigation of Random Subspace and Random Forest Methods Applied to Property Valuation Data. ICCCI (1) 2011: 142-151
[c22]
- view
  authority control:
- export record
  dblp key:
  - conf/kesamsta/LasotaLT11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/kesamsta/LasotaLT11
Tadeusz Lasota, Tomasz Luczak, Bogdan Trawinski:
Experimental Comparison of Resampling Methods in a Multi-Agent System to Assist with Property Valuation. KES-AMSTA 2011: 342-352

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.