\Finding hidden factors in large spatiotemporal data sets

被引:0
|
作者
Oja, E [1 ]
机构
[1] Aalto Univ, Dept Comp Sci & Engn, Helsinki 02015, Finland
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In many fields of science, engineering, medicine and economics, large or huge data sets are routinely collected. Processing and transforming such data to intelligible form for the human user is becoming one of the most urgent problems in near future. Neural networks and related statistical machine learning methods have turned out to be promising solutions. In many cases, the data matrix has both a spatial and a temporal dimension. Removing correlations and thus reducing the dimensionality is typically the first step in the processing. After this, higher-order statistical methods such as independent component analysis can often reveal the structure of the data by finding hidden factors. This can sometimes be enhanced by semi-blind techniques such as temporal filtering in order to use prior knowledge. Examples to be covered in the talk are biomedical fMRI data and long-term climate data, both having dimensionatities in the tens of thousands. Recent results are shown on brain activations to stimuli and on climate patterns.
引用
收藏
页码:PL1 / PL4
页数:4
相关论文
共 50 条
  • [1] A Bayesian spatiotemporal model for very large data sets
    Harrison, L. M.
    Green, G. G. R.
    [J]. NEUROIMAGE, 2010, 50 (03) : 1126 - 1141
  • [2] Uncovering Hidden Phylogenetic Consensus in Large Data Sets
    Pattengale, Nicholas D.
    Aberer, Andre J.
    Swenson, Krister M.
    Stamatakis, Alexandros
    Moret, Bernard M. E.
    [J]. IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2011, 8 (04) : 902 - 911
  • [3] An Efficient Motif Finding Algorithm for Large DNA Data Sets
    Yu, Qiang
    Huo, Hongwei
    Chen, Xiaoyang
    Guo, Haitao
    Vitter, Jeffrey Scott
    Huan, Jun
    [J]. 2014 IEEE INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICINE (BIBM), 2014,
  • [4] Finding hidden independent sets in interval graphs
    Biedl, T
    Brejová, B
    Demaine, ED
    Hamel, AM
    López-Ortiz, A
    Vinar, T
    [J]. COMPUTING AND COMBINATORICS, PROCEEDINGS, 2003, 2697 : 182 - +
  • [5] Finding hidden independent sets in interval graphs
    Biedl, T
    Brejová, B
    Demaine, ED
    Hamel, AM
    López-Ortiz, A
    Vinar, T
    [J]. THEORETICAL COMPUTER SCIENCE, 2004, 310 (1-3) : 287 - 307
  • [6] From searching to finding: New developments for managing large data sets
    Swienty-Busch, Juergen
    Evans, David
    [J]. ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 2014, 247
  • [7] Inapproximability of finding maximum hidden sets on polygons and terrains
    Eidenbenz, S
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2002, 21 (03): : 139 - 153
  • [8] Finding data sets for patrons
    Valentino, Maura L.
    [J]. Science and Technology Libraries, 2013, 32 (03): : 274 - 298
  • [9] Finding a large hidden clique in a random graph
    Alon, N
    Krivelevich, M
    Sudakov, B
    [J]. RANDOM STRUCTURES & ALGORITHMS, 1998, 13 (3-4) : 457 - 466
  • [10] Hidden Data Sets, an Untapped Resource
    Pickett, T.
    Marsh, N.
    Farthing, B.
    [J]. MODSIM 2005: INTERNATIONAL CONGRESS ON MODELLING AND SIMULATION: ADVANCES AND APPLICATIONS FOR MANAGEMENT AND DECISION MAKING: ADVANCES AND APPLICATIONS FOR MANAGEMENT AND DECISION MAKING, 2005, : 2832 - 2837