In this paper, we introduce an innovative approach to the fusion between datasets in terms of attributes and observations, even when they are not related at all. With our technique, starting from datasets representing independent worlds, it is possible to analyze a single global dataset, and transferring each dataset onto the others is always possible. This procedure allows a deeper perspective in the study of a problem, by offering the chance of looking into it from other, independent points of view. Even unrelated datasets create a metaphoric representation of the problem, useful in terms of speed of convergence and predictive results, preserving the fundamental relationships in the data. In order to extract such knowledge, we propose a new learning rule named double backpropagation, by which an auto-encoder concurrently codifies all the different worlds. We test our methodology on different datasets and different issues, to underline the power and flexibility of the Theory of Impossible Worlds.

1.
See http://archive.ics.uci.edu/ml/datasets/statlog+(australian+credit+approval) for “
Australian credit approval,
” (Accessed
2018
January 17).
2.
See https://archive.ics.uci.edu/ml/datasets/statlog+(german+credit+data) for “
German credit data,
” (Accessed
2018
January 17).
3.
H.
Abdi
and
L. J.
Williams
, “
Principal component analysis
,”
Wiley Interdiscip. Rev. Comput. Stat.
2
(
4
),
433
459
(
2010
).
4.
F.
Alexander Bais
and
J.
Doyne Farmer
, “
The physics of information
,” preprint arXiv:0708.2837 (
2007
).
5.
Y.
Bengio
 et al, “
Learning deep architectures for ai
,”
Found. Trends Mach. Learn.
2
(
1
),
1
127
(
2009
).
6.
C.
Benzmüller
and
L. C.
Paulson
, “
Quantified multimodal logics in simple type theory
,”
Logica Universalis
7
(
1
),
7
20
(
2013
).
7.
The frame problem in artificial intelligence
,” in Proceedings of the 7th WSEAS International Conference on Evolutionary Computing, Cavtat, Croatia, 12–14 June 2006, edited by
F. M.
Brown
(
2014
), pp.
12
19
.
8.
M.
Buscema
, Spin Net. Spin Net is Implemented in Modular Associative ANNs Semeion Software.
9.
M.
Buscema
, “
Recirculation neural networks
,”
Subst. Use Misuse
33
(
2
),
383
388
(
1998
).
10.
M.
Buscema
, “
The general philosophy of the artificial adaptive systems
,” in
Applications of Mathematics in Models, Artificial Neural Networks and Arts
(
Springer
,
2010
), pp.
197
226
.
11.
M.
Buscema
,
M.
Asadi-Zeydabadi
,
W.
Lodwick
, and
M.
Breda
, “
The h0 function, a new index for detecting structural/topological complexity information in undirected graphs
,”
Physica A
447
,
355
378
(
2016
).
12.
M.
Buscema
and
P. L.
Sacco
, “
Auto-contractive maps, the h function, and the maximally regular graph (MRG): A new methodology for data mining
,” in
Applications of Mathematics in Models, Artificial Neural Networks and Arts
(
Springer
,
2010
), pp.
227
275
.
13.
M.
Buscema
and
S.
Terzi
, “
A new evolutionary approach to topographic mapping
,”
Proceedings of the 7th WSEAS International Conference on Evolutionary Computing, Cavtat, Croatia, June 12–14
, (
2006
), pp.
12
19
.
14.
M.
Buscema
and
S.
Terzi
, “
Pst*: An evolutionary approach to the problem of multi dimensional scaling
,”
WSEAS Trans. Inf. Sci. Appl.
3
(
9
),
1704
1710
(
2006
).
15.
P. M.
Buscema
,
G.
Massini
,
M.
Breda
,
W. A.
Lodwick
,
F.
Newman
, and
M.
Asadi-Zeydabadi
,
Artificial Adaptive Systems Using Auto Contractive Maps: Theory, Applications and Extensions
(
Springer
,
2018
), Vol.
131
.
16.
P. M.
Buscema
and
W. J.
Tastle
, “
Artificial neural network what-if theory
,”
Int. J. Inf. Syst. Soc. Change (IJISSC)
6
(
4
),
52
81
(
2015
).
17.
E. F.
Codd
, “
A relational model of data for large shared data banks
,”
Commun. ACM
13
(
6
),
377
387
(
1970
).
18.
T. H.
Cormen
,
Introduction to Algorithms
(
MIT Press
,
2009
).
19.
R.
Forsyth
. https://archive.ics.uci.edu/ml/datasets/Zoo for “Zoo data set in 1990-05-15. UCI machine learning repository,” (Accessed
2018
April 16).
20.
G. E.
Hinton
and
J. L.
McClelland
, “
Learning representations by recirculation
,” in
Neural Information Processing Systems
(
American Institute of Physics
,
1988
), pp.
358
366
.
21.
G. E.
Hinton
and
R. R.
Salakhutdinov
, “
Reducing the dimensionality of data with neural networks
,”
Science
313
(
5786
),
504
507
(
2006
).
22.
M.
Jago
, “
Against yagisawa's modal realism
,”
Analysis.
73
(
1
),
10
17
(
2013
).
23.
M.
Jago
, “
Impossible worlds
,”
Noûs
49
(
4
),
713
728
(
2015
).
24.
B.
Khaleghi
,
A.
Khamis
,
F. O.
Karray
, and
S. N.
Razavi
, “
Multisensor data fusion: A review of the state-of-the-art
,”
Inf. Fusion
14
(
1
),
28
44
(
2013
).
25.
R.
Kohavi
 et al, “
A study of cross-validation and bootstrap for accuracy estimation and model selection
,” in
IJCAI
(
Montreal, Canada
,
1995
), Vol. 14, pp.
1137
1145
.
26.
Q. V.
Le
, “
Building high-level features using large scale unsupervised learning
,” in
2013 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
(
IEEE
,
2013
), pp.
8595
8598
.
27.
D.
Lewis
,
On the Plurality of Worlds
(
Oxford
,
1986
), Vol.
322
.
28.
MultiMedia LLC,
http://archive.ics.uci.edu/ml/datasets/optical+recognition+of+handwritten+digits for “
Optical recognition of handwritten digits data set
,”
1998
(Accessed 2017 October 19).
29.
R. N.
Mantegna
and
H.
Eugene Stanley
,
Introduction to Econophysics: Correlations and Complexity in Finance
(
Cambridge University Press
,
1999
).
30.
P.
Mishra
and
M. H.
Eich
, “
Join processing in relational databases
,”
ACM Comput. Surv.
24
(
1
),
63
113
(
1992
).
31.
D. P.
Nolan
,
Topics in the Philosophy of Possible Worlds
(
Taylor & Francis
,
2002
).
32.
A.
Pietarinen
, “
Impossible worlds and logical omniscience: A note on macpherson's logic of belief
,” in
The Tenth White House Papers Graduate Research in Cognitive and Computing Sciences at Sussex
(
1998
), p.
8
.
33.
G.
Ferilli
,
P. L.
Sacco
, and
G.
Tavano Blessi
,
Culture 3.0. Cultural Participation as a New Driver of Social and Economic Value Creation in European Cohesion Policies
(
IULM University
,
Milan
,
2018
).
34.
R.
Raina
,
A.
Madhavan
, and
A. Y.
Ng
, “
Large-scale deep unsupervised learning using graphics processors
,” in
Proceedings of the 26th Annual International Conference on Machine Learning
(
ACM
,
2009
), pp.
873
880
.
35.
D. E.
Rumelhart
,
G. E.
Hinton
, and
R. J.
Williams
, “
Learning representations by back-propagating errors
,”
Nature
323
(
6088
),
533
(
1986
).
36.
Semeion Research Centre of Sciences of Communication,
http://archive.ics.uci.edu/ml/datasets/semeion+handwritten+digit for Hand-written digits 16 × 16,
2008
(Accessed 2017 October 19).
37.
P.
Vincent
,
H.
Larochelle
,
I.
Lajoie
,
Y.
Bengio
, and
P.-A.
Manzagol
, “
Stacked denoising autoencoders: Learning useful representations in a deep network with a local denoising criterion
,”
J. Mach. Learn. Res.
11
,
3371
3408
(
2010
).
38.
E. N.
Zalta
 et al, “
A classically-based theory of impossible worlds
,”
Notre Dame J. Formal Logic
38
(
4
),
640
660
(
1997
).
39.
J.
Zhao
,
M.
Mathieu
,
R.
Goroshin
, and
Y.
Lecun
, “
Stacked what-where auto-encoders
,” preprint arXiv:1506.02351 (
2015
).
40.
J.
Zhao
,
M.
Mathieu
, and
Y.
LeCun
, “
Energy-based generative adversarial network
,” preprint arXiv:1609.03126 (
2016
).
You do not currently have access to this content.