检索结果-内蒙古大学图书馆

8th international Conference on Digital Technologies in Education, Science and Industry, DTESI 2023

作者： Baigabulov, Sagi Ipalakova, Madina T. International Information Technology University Manas St. 34/1 Almaty050040 Kazakhstan

Immersive data visualization solves the problems of traditional visualization methods, such as limited spatial sensitivity, lack of interactivity, and low level of ability to visualize complex 3D data structures, while providing immersion in virtual space, interacting with data, exploring it in a 3D environment, gaining new knowledge and patterns from data. this creates a deeper and richer data visualization experience, allowing users to discover hidden patterns and relationships between different aspects of the data that may be missed when using traditional visualization methods. there is a need for new methods and algorithms for data rendering as part of immersive data visualization in virtual environments since existing systems and solutions suffer from the following factors, such as long processing and preparation of one-dimensional and multidimensional data for rendering and analysis, inaccuracy of visualization due to excessive compression and processing, loss of necessary details, poor visual quality. this article provides a detailed overview of the process of data visualization, the difference between traditional methods and immersive methods, existing problems and solutions to these factors, and also proposes an integrated approach to immersive data visualization for the analysis of one-dimensional and multidimensional data. © 2023 Copyright for this paper by its authors.

关键词： data visualization

来源：评论

学校读者我要写书评

暂无评论

A novel pattern-based edit distance for automatic log parsing 26

A novel pattern-based edit distance for automatic log parsin...

引用

26th international Conference on Pattern Recognition / 8th international workshop on Image Mining - theory and Applications (IMTA)

作者： Raynal, Maxime Buob, Marc-Olivier Quenot, Georges Univ Grenoble Alpes CNRS Grenoble INP LIG F-38000 Grenoble France Nokia Bell Labs France Nozay Ile De France France

ISBN: (数字)9781665490627

ISBN: (纸本)9781665490627

this work aims at inferring a set of regular expressions to parse a text file, like a system log. To this end, we propose a novel edit distance taking advantage of the pattern matching background. Edit distances are commonly used for fuzzy search and in bioinformatics, and compare two strings at the character level. By doing so, edit distances do not consider the nature of the data conveyed by the strings. To address this problem, we propose the following contributions. First, we propose to model strings at the pattern level using a dedicated data structure, called pattern automaton. Second, we design a novel edit distance, operating at the pattern level. third, we derive a clustering algorithm optimized for this distance. Finally, we evaluate our proposal through experimental validation.

关键词： Biological system modeling Clustering algorithms Automata data structures Inference algorithms data models Proposals

来源：评论

学校读者我要写书评

暂无评论

BREAKING thE CURSE OF DIMENSIONALITY FOR COUPLED MATRIX-TENSOR FACTORIZATION 8

BREAKING THE CURSE OF DIMENSIONALITY FOR COUPLED MATRIX-TENS...

引用

8th IEEE international workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP)

作者： Boudehane, Abdelhak Zniyed, Yassine Tenenhaus, Arthur Le Brusquet, Laurent Boyer, Remy Univ Paris Sud Univ Paris Saclay CNRS Cent SupelecLab Signaux & Syst Gif Sur Yvette France Univ Lille 1 Ctr Rech Informat Signal & Automat Lille Villeneuve Dascq France

ISBN: (纸本)9781728155494

In different application fields, heterogeneous data sets are structured into either matrices or higher-order tensors. In some cases, these structures present the property of having common underlying factors, which is used to improve the efficiency of factor-matrices estimation in the process of the so-called coupled matrix-tensor factorization (CMTF). Many methods target the CMTF problem relying on alternating algorithms or gradient approaches. However, computational complexity remains a challenge when the data sets are tensors of high-order, which is linked to the well-known "curse of dimensionality". In this paper, we present a methodological approach, using the Joint dImensionality Reduction And Factors rEtrieval (JIRAFE) algorithm for joint factorization of high-order tensor and matrix. this approach reduces the high-order CMTF problem into a set of 3-order CMTF and canonical polyadic decomposition (CPD) problems. the proposed algorithm is evaluated on simulation and compared with a gradient-based method.

关键词： Coupled matrix tensor decomposition Tensor train Heterogeneous data analysis Joint estimation Fast algorithms

来源：评论

学校读者我要写书评

暂无评论

OCTEN: ONLINE COMPRESSION-BASED TENSOR DECOMPOSITION 8

OCTEN: ONLINE COMPRESSION-BASED TENSOR DECOMPOSITION

引用

8th IEEE international workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP)

作者： Gujral, Ekta Pasricha, Ravdeep Yang, Tianxiong Papalexakis, Evangelos E. UC Riverside Dept Comp Sci Riverside CA 92521 USA

ISBN: (数字)9781728155494

ISBN: (纸本)9781728155494

Tensor decompositions are powerful tools for large data analytics, as they jointly model multiple aspects of data into one framework and enable the discovery of the latent structures and higher-order correlations within the data. One of the most widely studied and used decompositions, especially in data mining and machine learning, is the Canonical Polyadic or PARAFAC decomposition. However, today's datasets are not static and often grow and change over time. To operate on such large dynamic data, we present OCTEN, the first ever compression-based online parallel implementation for the CP/PARAFAC decomposition. We conduct an extensive empirical analysis of the algorithms in terms of fitness, memory used and CPU time and in order to demonstrate the compression and scalability of the method, we apply OCTEN to big tensor data. Indicatively, OCTEN performs on-par or better than state-of-the-art online and offline methods in terms of decomposition accuracy and efficiency, while achieving memory savings ranging in 40-200%.

关键词： data Analytics

来源：评论

学校读者我要写书评

暂无评论

Breaking the Curse of Dimensionality for Coupled Matrix-Tensor Factorization

Breaking the Curse of Dimensionality for Coupled Matrix-Tens...

引用

IEEE international workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP)

作者： Abdelhak Boudehane Yassine Zniyed Arthur Tenenhaus Laurent Le Brusquet Remy Boyer Laboratoire des Signaux et Systèmes CentraleSupélec CNRS Univ. Paris-Sud Univ. Paris-Saclay Gif-sur-Yvette France Centre de Recherche en Informatique Signal et Automatique de Lille Univ. Lille 1 Villeneuve-d'Ascq France

ISBN: (数字)9781728155494

ISBN: (纸本)9781728155500

In different application fields, heterogeneous data sets are structured into either matrices or higher-order tensors. In some cases, these structures present the property of having common underlying factors, which is used to improve the efficiency of factor-matrices estimation in the process of the so-called coupled matrix-tensor factorization (CMTF). Many methods target the CMTF problem relying on alternating algorithms or gradient approaches. However, computational complexity remains a challenge when the data sets are tensors of high-order, which is linked to the well-known “curse of dimensionality”. In this paper, we present a methodological approach, using the Joint dImensionality Reduction And Factors rEtrieval (JIRAFE) algorithm for joint factorization of high-order tensor and matrix. this approach reduces the high-order CMTF problem into a set of 3-order CMTF and canonical polyadic decomposition (CPD) problems. the proposed algorithm is evaluated on simulation and compared with a gradient-based method.

关键词： Tensile stress Estimation Matrix decomposition Linear programming Optimization Computational modeling data models

来源：评论

学校读者我要写书评

暂无评论

Benefits and Application of Tree structures in Gaussian Process Models to Optimize Magnetic Field Shaping Problems 8th

引用

8th international workshop on Simulation

作者： Vollert, Natalie Ortner, Michael Pilz, Juergen CTR Carinthian Tech Res AG Europastr 12 A-9524 Villach Austria Alpen Adria Univ Klagenfurt Dept Stat Univ Str 65-67 A-9020 Klagenfurt Austria

ISBN: (纸本)9783319760353;9783319760346

Recent years have witnessed the development of powerful numerical methods to emulate realistic physical systems and their integration into the industrial product development process. Today, finite element simulations have become a standard tool to help with the design of technical products. However, when it comes to multivariate optimization, the computation power requirements of such tools can often not be met when working with classical algorithms. As a result, a lot of attention is currently given to the design of computer experiments approach. One goal of this work is the development of a sophisticated optimization process for simulation based models. Within many possible choices, Gaussian process models are most widely used as modeling approach for the simulation data. However, these models are strongly based on stationary assumptions that are often not satisfied in the underlying system. In thiswork, treed Gaussian process models are investigated for dealing with non-stationarities and compared to the usual modeling approach. the method is developed for and applied to the specific physical problem of the optimization of 1D magnetic linear position detection.

关键词： Gaussian process surrogates Non-stationarity Simulation data Tree models

来源：评论

学校读者我要写书评

暂无评论

Approximate furthest neighbor with application to annulus query

引用

INFORMATION SYSTEMS 2017年 64卷 152-162页

作者： Pagh, Rasmus Silvestri, Francesco Sivertsen, Johan Skala, Matthew IT Univ Copenhagen Copenhagen Denmark

Much recent work has been devoted to approximate nearest neighbor queries. Motivated by applications in recommender systems, we consider approximate furthest neighbor (AFN) queries and present a simple, fast, and highly practical data structure for answering AFN queries in high-dimensional Euclidean space. the method builds on the technique of Indyk (SODA 2003), storing random projections to provide sublinear query time for AFN. However, we introduce a different query algorithm, improving on Indyk's approximation factor and reducing the running time by a logarithmic factor. We also present a variation based on a query-independent ordering of the database points;while this does not have the provable approximation factor of the query-dependent data structure, it offers significant improvement in time and space complexity. We give a theoretical analysis and experimental results. As an application, the query-dependent approach is used for deriving a data structure for the approximate annulus query problem, which is defined as follows: given an input set S and two parameters r > 0 and w >= 1, construct a data structure that returns for each query point q a point p is an element of S such that the distance between p and q is at least r/w and at most wr. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： SEARCH algorithms RECOMMENDER systems (Information filtering) EUCLIDEAN distance data structures (Computer science) SPACE & time

来源：评论

学校读者我要写书评

暂无评论

Treemaps and the Visual comparison of hierarchical multi-attribute data 16

Treemaps and the Visual comparison of hierarchical multi-att...

引用

13th ACM international Working Conference on Advanced Visual Interfaces, AVI 2016

作者： Wittenburg, Kent Turchi, Tommaso Mitsubishi Electric Research Laboratories Inc. 201 Broadway 8th Floor CambridgeMA02129 United States Brunel University London Kingston Ln Uxbridge MiddlesexUB83PH United Kingdom

ISBN: (纸本)9781450341318

Treemaps have the desirable property of presenting overviews along with details of data and thus are of interest in visualizations of multi-attribute tabular data with attribute hierarchies. However, the original treemap algorithms and most subsequent variations are hampered in making parallel structures in a hierarchical data structure visually comparable. Structurally parallel elements are not aligned, making it difficult to compare them visually. We propose a method that allows for proportional and non-proportional subdivisions of subtrees while preserving visual alignment of parallel structures. We extend the framework so that other types of data visualizations can be placed within the graphical areas of a treemap to allow for the visual comparison of a broad collection of data types including temporal data. © 2016 Copyright held by the owner/author(s).

关键词： data visualization

来源：评论

学校读者我要写书评

暂无评论

Computer-Aided data Processing for GPR Profiling Applications 8

Computer-Aided Data Processing for GPR Profiling Application...

引用

8th international workshop on Advanced Ground Penetrating Radar (IWAGPR)

作者： Kapustin, V. V. Shirobokov, M. P. LOGIS GEOTECH Co Dept Geophys Moscow Russia

ISBN: (纸本)9781479964956

At present, GPR profiling is widely used in engineering surveys and geotechnical investigations to handle various tasks. High efficiency and resolution of GPR technique help to obtain huge volumes of data, which need quicklook (real-time) data processing. In particular, this usually occurs while GPR surveys in highway and railway engineering, in water areas (rivers and lakes), line structures, etc. Here, the basic data-processing problem is of GPR records matching stretched interfaces of the beds with varying electrical and physical characteristics. Several algorithms were tested to pick wave patterns;STA\LTA tracing algorithms based on Radon or Hough transforms seemed to be the best to solve the problem.

关键词： component formatting style styling inserts (key words)

来源：评论

学校读者我要写书评

暂无评论

A Rapid Mapping Approach to Quantify Damages Caused by the 2003 Bam Earthquake Using High Resolution Multitemporal Optical Images 8

A Rapid Mapping Approach to Quantify Damages Caused by the 2...

引用

2015 8th international workshop on the Analysis of Multitemporal Remote Sensing Images (Multi-Temp)

作者： Faur, Daniela Datcu, Mihai Univ Politehn Bucuresti Dept Appl Elect & Informat Engn Bucharest 060042 Romania German Aerosp Ctr Remote Sensing Technol Inst Wesling Germany

ISBN: (纸本)9781467371193

this paper aims to reveal a methodology used to quantitatively evaluate the impact of an earthquake on a region, considering multi temporal high resolution optical images. the proposed approach was initiated in the frame of GEODIM Project whose goal is to develop a Romanian downstream emergency response service in order to contribute to current disaster and risk management approach based on Earth observation data. the project is focused on developing experimental processing algorithms and mapping products for natural disasters (floods, earthquakes, landslides) damage assessment in urban areas based on very high resolution optical and SAR satellite imagery acquired worldwide. the prospective scenario considers knowledge discovery from pre and post event satellite images by mapping the extracted data features into semantic classes and symbolic representations like "buildings", "vegetation", "streets", "bare land" and "damaged buildings", etc.

关键词： Earthquakes

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：