Commit Inicial

This commit is contained in:
2020-11-20 11:23:40 +01:00
commit 5611e5bc01
2914 changed files with 2625178 additions and 0 deletions

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

49
data/tanveer/nursery/le_datos.m Executable file
View File

@@ -0,0 +1,49 @@
printf('lendo problema %s ...\n', problema);
n_entradas= 8; n_clases= 5; n_fich= 1; fich{1}= 'nursery.data'; n_patrons(1)= 12960;
n_max= max(n_patrons);
x = zeros(n_fich, n_max, n_entradas); cl= zeros(n_fich, n_max);
n_patrons_total = sum(n_patrons); n_iter=0;
n_val_entrada = [3 5 4 4 3 2 3 3]; max_n_val_entrada=max(n_val_entrada);
val_entrada=cell(n_entradas, max_n_val_entrada);
clase={'not_recom', 'recommend', 'very_recom', 'priority', 'spec_prior'};
f=fopen('valores_entradas.dat', 'r');
if -1==f
error('erro en fopen abrindo valores_entradas.dat')
end
for i=1:n_entradas
for j=1:n_val_entrada(i)
val_entrada{i,j} = fscanf(f,'%s', 1);
% printf('%s ', val_entrada{i,j})
end
% printf('\n')
end
fclose(f);
for i_fich=1:n_fich
f=fopen(fich{i_fich}, 'r');
if -1==f
error('erro en fopen abrindo %s\n', fich{i_fich});
end
for i=1:n_patrons(i_fich)
fprintf(2,'%5.1f%%\r', 100*n_iter++/n_patrons_total);
for j = 1:n_entradas
t = fscanf(f,'%s',1);
for k=1:n_val_entrada(j)
if strcmp(t, val_entrada{j,k})
x(i_fich,i,j) = k; break
end
end
end
t = fscanf(f,'%s',1); % lectura da clase
for k=1:n_clases
if strcmp(t, clase{k})
cl(i_fich,i) = k-1; break
end
end
end
fclose(f);
end

12971
data/tanveer/nursery/nursery.arff Executable file

File diff suppressed because it is too large Load Diff

View File

@@ -0,0 +1,8 @@
% Rows Columns
5 5
% Matrix elements
0.0 1.0 1.0 1.0 1.0
1.0 0.0 1.0 1.0 1.0
1.0 1.0 0.0 1.0 1.0
1.0 1.0 1.0 0.0 1.0
1.0 1.0 1.0 1.0 0.0

12961
data/tanveer/nursery/nursery.data Executable file

File diff suppressed because it is too large Load Diff

View File

@@ -0,0 +1,101 @@
1. Title: Nursery Database
2. Sources:
(a) Creator: Vladislav Rajkovic et al. (13 experts)
(b) Donors: Marko Bohanec (marko.bohanec@ijs.si)
Blaz Zupan (blaz.zupan@ijs.si)
(c) Date: June, 1997
3. Past Usage:
The hierarchical decision model, from which this dataset is
derived, was first presented in
M. Olave, V. Rajkovic, M. Bohanec: An application for admission in
public school systems. In (I. Th. M. Snellen and W. B. H. J. van de
Donk and J.-P. Baquiast, editors) Expert Systems in Public
Administration, pages 145-160. Elsevier Science Publishers (North
Holland)}, 1989.
Within machine-learning, this dataset was used for the evaluation
of HINT (Hierarchy INduction Tool), which was proved to be able to
completely reconstruct the original hierarchical model. This,
together with a comparison with C4.5, is presented in
B. Zupan, M. Bohanec, I. Bratko, J. Demsar: Machine learning by
function decomposition. ICML-97, Nashville, TN. 1997 (to appear)
4. Relevant Information Paragraph:
Nursery Database was derived from a hierarchical decision model
originally developed to rank applications for nursery schools. It
was used during several years in 1980's when there was excessive
enrollment to these schools in Ljubljana, Slovenia, and the
rejected applications frequently needed an objective
explanation. The final decision depended on three subproblems:
occupation of parents and child's nursery, family structure and
financial standing, and social and health picture of the family.
The model was developed within expert system shell for decision
making DEX (M. Bohanec, V. Rajkovic: Expert system for decision
making. Sistemica 1(1), pp. 145-157, 1990.).
The hierarchical model ranks nursery-school applications according
to the following concept structure:
NURSERY Evaluation of applications for nursery schools
. EMPLOY Employment of parents and child's nursery
. . parents Parents' occupation
. . has_nurs Child's nursery
. STRUCT_FINAN Family structure and financial standings
. . STRUCTURE Family structure
. . . form Form of the family
. . . children Number of children
. . housing Housing conditions
. . finance Financial standing of the family
. SOC_HEALTH Social and health picture of the family
. . social Social conditions
. . health Health conditions
Input attributes are printed in lowercase. Besides the target
concept (NURSERY) the model includes four intermediate concepts:
EMPLOY, STRUCT_FINAN, STRUCTURE, SOC_HEALTH. Every concept is in
the original model related to its lower level descendants by a set
of examples (for these examples sets see
http://www-ai.ijs.si/BlazZupan/nursery.html).
The Nursery Database contains examples with the structural
information removed, i.e., directly relates NURSERY to the eight input
attributes: parents, has_nurs, form, children, housing, finance,
social, health.
Because of known underlying concept structure, this database may be
particularly useful for testing constructive induction and
structure discovery methods.
5. Number of Instances: 12960
(instances completely cover the attribute space)
6. Number of Attributes: 8
7. Attribute Values:
parents usual, pretentious, great_pret
has_nurs proper, less_proper, improper, critical, very_crit
form complete, completed, incomplete, foster
children 1, 2, 3, more
housing convenient, less_conv, critical
finance convenient, inconv
social non-prob, slightly_prob, problematic
health recommended, priority, not_recom
8. Missing Attribute Values: none
9. Class Distribution (number of instances per class)
class N N[%]
------------------------------
not_recom 4320 (33.333 %)
recommend 2 ( 0.015 %)
very_recom 328 ( 2.531 %)
priority 4266 (32.917 %)
spec_prior 4044 (31.204 %)

View File

@@ -0,0 +1,8 @@
n_entradas= 8
n_clases= 5
n_arquivos= 1
fich1= nursery_R.dat
n_patrons1= 12960
n_patrons_entrena= 6480
n_patrons_valida= 6480
n_conxuntos= 1

12961
data/tanveer/nursery/nursery_R.dat Executable file

File diff suppressed because it is too large Load Diff

View File

@@ -0,0 +1,8 @@
usual pretentious great_pret
proper less_proper improper critical very_crit
complete completed incomplete foster
1 2 3 more
convenient less_conv critical
convenient inconv
non-prob slightly_prob problematic
recommended priority not_recom