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

8th international workshop on database and Expert Systems Applications

作者： Choenni, S Siebes, A Natl Aerospace Lab Amsterdam Netherlands

ISBN: (纸本)0818681489

In order to extract knowledge from databases, data mining algorithms heavily query the databases. Inefficient processing of these queries will inevitably have its impact on the performance of these algorithms, making them less valuable. In this paper, we describe an optimization framework for an efficient processing of queries generated by different data mining algorithms. We show how to take advantage of the physical organization of the database, the operators and the control structures used in an algorithm. Finally, we discuss how our framework fits into conventional query optimization frameworks.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

An improved bound on Boolean matrix multiplication for highly clustered data

引用

8th international workshop on algorithms and data structures (wads 2003)

作者： Gasieniec, L Lingas, A Univ Liverpool Dept Comp Sci Liverpool L69 7ZF Merseyside England Lund Univ Dept Comp Sci S-22100 Lund Sweden

ISBN: (纸本)3540405453

We consider the problem of computing the product of two n x n Boolean matrices A and B. For two 0 - I strings s = s(1)s(2) .... s(m) and u = u(1)u(2) ... u(m), an extended Hamming distance, eh(s, u), between the strings, is defined by a recursive equation eh(s, u) = eh(s(l+1) ... s(m), u(l+1) ... u(m)) + (s(1) + u(1) mod 2), where l is the maximum number, s.t., s(j) = s, and u(j) = u(1) for j = For any n x n Boolean matrix C, let GC be a complete weighted graph on the rows of C, where the weight of an edge between two rows is equal to its extended Hamming distance. Next, let MWT(C) be the weight of a minimum weight spanning, tree of GC. WE! show that the product of A and B as well as the so called witnesses of the product can be computed in time (O) over bar (n(n + min{MWT(A), MWT(B-t)}))(1). Since the extended Hamming distance between two strings never exceeds the standard Hamming distance between them, our result subsumes an earlier similar result on the Boolean matrix product in terms of the Hamming distance due to Bjorklund and Lingas [4]. We also observe that min{MWT(A),MWT(B-t)} = O(min{r(A),r(B)}), where r(A) and r(B) reflect the minimum number of rectangles required to cover ls in A and B, respectively. Hence, our result also generalizes the recent upper bound on the Boolean matrix product in terms of r(A) and r(B), due to Lingas [12].

关键词： Hamming distance

来源：评论

学校读者我要写书评

暂无评论

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 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

来源：评论

学校读者我要写书评

暂无评论

Phylogenetic reconstruction from gene-rearrangement data with unequal gene content

引用

8th international workshop on algorithms and data structures, wads 2003

作者： Tang, Jijun Moret, Bernard M. E. Dept. of Computer Science University of New Mexico AlbuquerqueNM87131 United States

ISBN: (纸本)3540405453

Phylogenetic reconstruction from gene-rearrangement data has seen increased attention over the last five years. Existing methods are limited computationally and by the assumption (highly unrealistic in practice) that all genomes have the same gene content. We have recently shown that we can scale our reconstruction tool, GRAPPA, to instances with up to a thousand genomes with no loss of accuracy and at minimal computational cost. Computing genomic distances between two genomes with unequal gene contents has seen much progress recently, but that progress has not yet been reflected in phylogenetic reconstruction methods. In this paper, we present extensions to our GRAPPA approach that can handle limited numbers of duplications (one of the main requirements for analyzing genomic data from organelles) and a few deletions. Although GRAPPA is based on exhaustive search, we show that, in practice, our bounding functions suffice to prune away almost all of the search space (our pruning rates never fall below 99.995%), resulting in high accuracy and fast running times. the range of values within which we have tested our approach encompasses mitochondria and chloroplast organellar genomes, whose phylogenetic analysis is providing new insights on evolution. © Springer-Verlag Berlin Heidelberg 2003.

关键词： Genes

来源：评论

学校读者我要写书评

暂无评论

In-place calculation of minimum-redundancy codes 4th

In-place calculation of minimum-redundancy codes

引用

4th international workshop on algorithms and data structures (wads 95)

作者： Moffat, A Katajainen, J UNIV COPENHAGEN DEPT COMP SCI DK-2100 COPENHAGEN DENMARK

ISBN: (纸本)3540602208

the optimal prefix-free code problem is to determine, for a given array p = [p(i) \i is an element of {1...n}] of n weights, an integer array I = [l(i) \i is an element of (1...n)] of n codeword lengths such that Sigma(i=1)(n) 2(-li) less than or equal to 1 and Sigma(i=1)(n) p(i)l(i) is minimized. Huffman's famous greedy algorithm solves this problem in O(n log n) time, if p is unsorted;and can be implemented to. execute in O(n) time, if the input array p is sorted. Here we consider the space requirements of the greedy method. We show that if p is sorted then it is possible to calculate the array 1 in-place, with l(i) overwriting pi, in O(n) time and using O(1) additional space. the new implementation leads directly to an O(n log n)-time and n + O(1) words of extra space implementation for the case when p is not sorted. the proposed method is simple to implement and executes quickly.

关键词： prefix-free code Huffman code in-place algorithm data compression

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

2013 8th international workshop on Systems, Signal Processing and their Applications, WoSSPA 2013

2013 8th International Workshop on Systems, Signal Processin...

引用

2013 8th international workshop on Systems, Signal Processing and their Applications, WoSSPA 2013

ISBN: (纸本)9781467355407

the proceedings contain 92 papers. the topics discussed include: multimodal image fusion of anatomical structures for diagnosis, therapy planning and assistance;a robust geometrical method for blind separation of noisy mixtures of non-negatives sources;blind unmixing of remote sensing data with some pure pixels: extension and comparison of spatial methods exploiting sparsity and nonnegativity properties;comparative performance analysis of non orthogonal joint diagonalization algorithms;tensor estimation and visualization using dMRI;toward an adaptive extraction method of masses in digitized mammograms;temporal signatures of electrodermal activity for the evaluation of runners' performance: start and finish phases;stereo image coding: state of the art;and hybrid chaos-based image encryption approach using block and stream ciphers.

关键词：

来源：评论

学校读者我要写书评

暂无评论

New achievements in development of multidimensional data acquisition, processing and visualization system -: DAQPROVIS

引用

NUCLEAR INSTRUMENTS & MEthODS IN PHYSICS RESEARCH SECTION A-ACCELERATORS SPECTROMETERS DETECTORS AND ASSOCIATED EQUIPMENT 2003年第2-3期502卷 728-730页

作者： Morhác, M Matousek, V Kliman, J Turzo, I Krupa, L Jandel, M Slovak Acad Sci Inst Phys Bratislava 84228 Slovakia

Modular system to acquire, store;analyze and process experimental nuclear data is described. Besides standard methods new developed algorithms also have been included in the system. (C) 2003 Elsevier Science B.V. All ... 详细信息

关键词： data acquisition background elimination deconvolution peak searching peak fitting spectra visualization

来源：评论

学校读者我要写书评

暂无评论

Mathematical framework for representing discrete functions as word-level polynomials 8

Mathematical framework for representing discrete functions a...

引用

8th Annual IEEE international workshop on High-Level Design Validation and Test workshop

作者： Pradhan, DK Askar, S Ciesielski, M Univ Bristol Dept Comp Sci Bristol BS8 1UB Avon England

ISBN: (纸本)0780382366

this paper presents a mathematical framework for modeling arithmetic operators and other RTL design modules as discrete word-level functions and proposes a polynomial representation of those functions. the proposed representation attempts to bridge the gap between bit-level BDD representations and word-level representations, such as *BMDs and TEDs.

关键词： Binary decision diagrams Boolean functions Bridges Computer science data structures Design engineering Digital arithmetic Logic functions Polynomials Robustness

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：