Cognitive Infocommunications (CogInfoCom) messages that are used to carry information on the state of the same high-level concept can be regarded as belonging to a CogInfoCom channel. Such channels can be generated using any kind of parametric model. By changing the values of the parameters, it is possible to arrive at a large variety of CogInfoCom messages, a subset of which can belong to a CogInfoCom channel -provided they are perceptually well-suited to the purpose of conveying information on the same highlevel concept. Thus, for any CogInfoCom channel, we may speak of a parameter space and a perceptual space that is created by the totality of messages in the CogInfoCom channel. In this paper, we argue that in general, the relationship between the parameter space and the perceptual space is highly non-linear. For this reason, it is extremely difficult for the designer of a CogInfoCom channel to tune the parameters in such a way that the resulting CogInfoCom messages are perceptually continuous, and suitable to carry information on a single high-level concept. To address this problem, we propose a cognitive artifact that uses a rank concept available in tensor algebra to provide the designer of CogInfoCom channels with practical tradeoffs between complexity and interpretability. We refer to the artifact as the Spiral Discovery Method (SDM).
[1]
Phil Barnard,et al.
Bridging between basic theories and the artifacts of human-computer interaction
,
1991
.
[2]
Joos Vandewalle,et al.
A Multilinear Singular Value Decomposition
,
2000,
SIAM J. Matrix Anal. Appl..
[3]
Peter Baranyi,et al.
A unified terminology for CogInfoCom applications
,
2011,
2011 2nd International Conference on Cognitive Infocommunications (CogInfoCom).
[4]
Hideyuki Takagi,et al.
Interactive evolutionary computation: fusion of the capabilities of EC optimization and human evaluation
,
2001,
Proc. IEEE.
[5]
Meera Blattner,et al.
Earcons and Icons: Their Structure and Common Design Principles
,
1989,
Hum. Comput. Interact..
[6]
L. Lathauwer,et al.
Dimensionality reduction for higher-order tensors: algorithms and applications
,
2008
.