dimensional data发音

意思翻译

尺寸数

相似词语短语

dimensional───adj.空间的；尺寸的

dimensional stability───[测][纺][纸]尺寸稳定性；[纺]形稳性；尺寸恒定性，尺寸稳定性，形稳性

dimensional funds───多维基金

dimensional analysis───[物]量纲分析；量纲[因次]分析

dimensional mercenary───空间雇佣兵

data───n.（Data）（日）驮太（姓）；（印、葡）达塔（人名）；n.数据；资料

three dimensional───三维的；立体的；[计] 三维的，立体的，三度的

dimensional lumber───规格材

dimensional lumber sizes───木材尺寸

双语使用场景

're designing your dimension table, you need to plan for changing dimensional data.───在设计维度表时，需要计划变更维度数据。

Data mining is about digging up interesting information from this high-dimensional data.───数据挖掘便是要从高维数据中挖出那些令人感兴趣的信息来。

A dimensional data model might also be a good choice because it is user-friendly and has better performance.───维度数据模型也可能是较好的选择，因为它是用户友好的，并具有更好的性能。

If the objective is to perform multidimensional data analysis, a dimensional data model would be the only choice here.───如果其目标是执行多维数据分析，那么维度数据模型就是这里的惟一选择。

Experiment results prove that this refined algorithm has better clustering results on multi-dimensional data set than SNN algorithm.───实验结果表明，RSNN算法比SNN算法在时空数据集上具有更好的聚类效果。

Now, with a plethora of high-dimensional data available, such work can be applied to real-world scenarios.───今天，通过庞大的高维数据和高性能的计算机，这些工作可以应用于现实的情景。

An R-Tree data structure stores information about multi-dimensional data and is used for indexes on spatial or geographical data.───R-Tree数据结构可以保存有关多维数据的信息，并用于有关空间或地理数据的索引。

Absrtact: The problem of similarity measurement between high dimensional data is one of the problems high-dimensional data mining faces.───摘要：高维数据之间的相似性度量问题是高维空间数据挖掘中所面临的问题之一。

The Locally Linear Embedding(LLE) algorithm is an effective technique for nonlinear dimensionality reduction of high-dimensional data.───局部线性嵌入（LLE）算法是有效的非线性降维方法，时间复杂度低并具有强的流形表达能力。

英语使用场景

RESULTSL Three - dimensional data of facial profile was accurate and the images were reconstructed with verisimilitude.

Graphic Analysis of Three – Dimensional Data?

High - dimensional data mining faces the challenges of distributed data sparsity and overlapping feature subspace.

But mining in high dimensional data is extraordinarily difficult because of the curse of dimensionality.

Each colorized pixel point maps a value, and a dimensional data is displayed in different section for partitioning section of rotundity.

A new efficient index structure is presented for high - dimensional data space - Clustering Pyramid - tree.

The pyramid technique is a good indexing method for high dimensional data, but it is only efficient for uniform data sets.