Relations and GUHA-Style Data Mining II

0405003 - UIVT-O 20030056 RIV DE eng C - Conference Paper (international conference)
Hájek, Petr
Relations and GUHA-Style Data Mining II.
Relational Methods in Computer Science. Kiel: Christian-Albrechts-Universität, 2003 - (Berghammer, R.; Möller, B.), s. 242-247
[International Conference RelMiCS /7./, Workshop of COST Action 274 TARSKI /2./. Bad Malente (DE), 12.05.2003-17.05.2003]
R&D Projects: GA MŠMT OC 274.001
Grant - others:COST(XE) Action 274 TARSKI
Institutional research plan: AV0Z1030915
Keywords : data mining * GUHA method * relational structures
Subject RIV: BA - General Mathematics

Here we shall be interested in some aspects of theoretical foundations of GUHA (useful as foundations of other data mining methods as well); namely, in generalized predicate calculi for expressing dependencies hidden in data, notably a sort of finite model theory with generalized quantifiers (mostly two-dimensional), and Boolean algebras with additional relations given by a data set and a generalized quantifier.
Permanent Link: http://hdl.handle.net/11104/0125223