dimensional data的意思

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.