

                   File format short description


#####################################################################################


-------------------------------------------------------------------------------------
[ INPUT ][ INPUT ][ INPUT ][ INPUT ][ INPUT ][ INPUT ][ INPUT ][ INPUT ][ INPUT ]
-------------------------------------------------------------------------------------
	The input file describe the relational itemset (ri) giving both objects
description in terms of itemsets -ie. transactions- and objects relations
- ie. a graph-.

---------------------- Line 1 (fixed text label) --
[Relational Context]

---------------------- Line 2 (free text) --
title line

---------------------- Line 3 (fixed text label) --
[Binary Relation]

---------------------- Line 4 (free text) --
line of free comments

---------------------- Line 5 (formated) --
List of object names separated by a pipe (|) caracter.
Only letters, numbers, caracters '-' (minus), '_' (underscore) and '@' (arobase) are
allowed in object names

exple:

obj_ 1| obj_2 | obj_3 

---------------------- Line 6 (formated) --
List of attributes separated by a pipe (|) caracter.
Only letters, numbers, caracters '-' (minus), '_' (underscore) and '@' (arobase) are
allowed in object names

exple:

att_ 1| att_2 | att_3 

--------------------- Line 7 to 6+N (formated) --
Boolean matrix describing the vector of attributes of each objects
If the dataset has n objects and m attributes, then the matrix has
dimension (n,m).

Element a(i,j) of the matrix is set
	[-] to 1 if object i has attribute j
	[-] to 0 if object i has not attribute j

Exple for dataset of 3 objects ans 4 attributes
0 0 1 1
0 1 1 1
1 0 0 0

---------------------- Line (fixed) --
[END Relational Context]

---------------------- Line (fixe) --
[Graph Relation]

---------------------- formatees lines --
The following lines give the adjacency list of each object. Far example if the
object obj_i is linked to obj_n, obj_m and obj_p the adjacency list of obj_i
is given as follow:

exple:

obj_i obj_n, obj_m, obj_p

---------------------- Last Line (fixe) --
[END Graph Relation]






-------------------------------------------------------------------------------------
[ OUTPUT ][ OUTPUT ][ OUTPUT ][ OUTPUT ][ OUTPUT ][ OUTPUT ][ OUTPUT ][ OUTPUT ][ OUTPUT ]
-------------------------------------------------------------------------------------
	The output file gives the local abstract closed pattern in a .abs file
The file of results contains 3 sections

---------------------------------------------------------
First Section:        # clos_loc_abs ------------------

gives the set of local closed pattern, the extension (object litteral names) and the original
global closed patterns from which they derives formated as

closed_local_pattern (extension list) +; [list of original closed patterns]


---------------------------------------------------------
Second Section:       # clos_infreq  ------------------ 

gives the liste of original closed pattern that turn infrequent because of one of the
abstraction (remind that abstraction removes nodes).


---------------------------------------------------------
Third Section:       reduced_rules -----------------

For each locol closed pattern this section gives

spec_coef extension local_closed_pattern [list of most general original patterns]

where
	[spec_coef] is the ratio of the size of the local_closed_pattern extension in the
	transaction table over the size of the local extension
	
	[extension] the local extension
	
	[local_closed pattern] no comment
	
	[list of most general original patterns] is the list of original closed patterns
	which the local closed pattern derives reduced to the most general parrterns.



 




