metarelation_mining
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
metarelation_mining [2021/08/27 16:56] – ymkw | metarelation_mining [2021/08/31 18:34] (current) – ymkw | ||
---|---|---|---|
Line 1: | Line 1: | ||
====== Metarelation Mining ====== | ====== Metarelation Mining ====== | ||
=== Technology Overview === | === Technology Overview === | ||
- | " | ||
- | > {{ : | + | Metarelation mining |
- | > Figure: Example | + | |
- | In equivalence structure extraction, when two or more pairs are compared and " | ||
- | Translated with www.DeepL.com/ | + | {{ :fig1.png?600 |}} |
+ | |||
+ | Fig. 1: An illustration of ES extraction. Two three-dimensional sequences specified by tuples <#1, #2, #3> and <#8, #7, #5> are compared to validate if there is a metarelation between the three-dimensional sequences. Because a subsequence of one three-dimensional sequence shown by a blue, a red and a black box closely resembles a subsequence of the other 3d sequence, they are likely to be considered to have an analogous metarelation. | ||
+ | |||
+ | In ES extraction, an analogous metarelation between two multidimensional sequences is considered found based on the comparisons of their subsequences. The implementation of such comparisons allows for finding relations between asynchronous sequences. Therefore, ES extraction can be applicable to data that are “asynchronous” and “the attribute of each sequence is unknown.” A task using such data can be a task to find metarelations between the brainwaves of a human and those of a chimpanzee. Such data are usually asynchronous, | ||
+ | |||
+ | One difficulty in the ES extraction is that the brute-force search is usually not feasible. Given N sequences, the number of K-tuples is K-permutations of N, which causes a combinatorial explosion. Moreover, comparisons of subsequences are implemented for each comparison of two K-dimensional sequences specified by K-tuples. To reduce the processing time, we recently propose a method called ESIS, in which ESs are obtained increasing K. In the future, we plan to propose a yet faster method. | ||
- | The major problem with ES extraction is its large computational complexity. If the number of all series is N and the size of a pair is K, the number of pairs to be searched is K permutations out of N. Furthermore, | ||
=== Related works === | === Related works === | ||
Line 27: | Line 29: | ||
* Hiroshi, Yamakawa. “Hippocampal Formation Mechanism Will Inspire Frame Generation for Building an Artificial General Intelligence’’. In Proc. of the International Conference on Artificial General Intelligence (AGI), 2012. pp.362--371. | * Hiroshi, Yamakawa. “Hippocampal Formation Mechanism Will Inspire Frame Generation for Building an Artificial General Intelligence’’. In Proc. of the International Conference on Artificial General Intelligence (AGI), 2012. pp.362--371. | ||
- | === 連絡先 | + | === Contact |
- | 佐藤聖也(AIST) , | + | Seiya Sato (Tokyo Denki University) , |
metarelation_mining.1630050994.txt.gz · Last modified: 2021/08/27 16:56 by ymkw