KDD procedures – SD4ft-Miner

 

SD4ft-Miner procedure

Author(s):

Milan Šimůnek, Jan Rauch

Responsibility:

Jan Rauch (theory), Milan Šimůnek (software), Martin Kejkula (help)

Description:

Data mining procedure SD4ft-Miner mines for patterns of the form Ant Suc / (α, β, Cond). Here Ant, Suc, α, β and Cond are Boolean attributes that are derived from the columns of the analysed data matrix.

The intuitive meaning of the pattern Ant Suc / (α, β, Cond) is that the relation of attributes Ant and Suc in set a differs from the relation of attributes Ant and Suc in set β when the condition given by the Boolean attribute Cond is satisfied.

The symbol is called SDCF-quantifier. It corresponds to a condition imposed on two four-fold contingency tables of Ant and Suc. The pattern Ant Suc / (α, β, Cond) is verified such that this condition is applied on the contingency tables of Ant and Suc in data matrices M / α / Cond and M / β / Cond.

Here M is the analysed data matrix and M / α is a data matrix consisting of all rows of data matrix M given by the Boolean attribute α. Further, M / α / Cond is a data matrix consisting of all rows of M / α atisfying the condition Cond. Let us remark that M / α / Cond can be understood as M / (α Cond). Analogously for M / β / Cond.

Files to download:
LISp-Miner.Core.OldUI.zip 33.45 MB August 13, 2014
Legacy LISp-Miner system core files separated into modules for each GUHA procedure. Contains also other legacy modules LMAdmin and LMDataSource.
History:

The first version of the SD4ft procedure was suggested by J. Rauch in 2002 The name of this version was SDS-Miner. The SDS-Miner was implememted in a simplified version by T. Karban, see [KRS 04], [Ka 04]. The software tools for dealing with strings of bits developed for the 4ft-Miner procedure were used.

The new version of the SD4ft procedure was suggested by J. Rauch in 2004. Reason was the necessity to mine for patterns of the form Ant Suc / (α, β, Cond).

The new version was implemented by M. Šim?nek.

Print page

 
 

Send comments about this site to the webmaster