Subspace tree: high dimensional multimedia indexing with logarithmic temporal complexity

ISSN： 0925-9902

Source： Journal of Intelligent Information Systems, Vol.35, Iss.3, 2010-12, pp. : 495-516

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Automatic Subspace Clustering of High Dimensional Data

By Agrawal Rakesh Gehrke Johannes Gunopulos Dimitrios Raghavan Prabhakar

Data Mining and Knowledge Discovery, Vol. 11, Iss. 1, 2005-07 ,pp. : 5-33

Springer Publishing Company

Access to resources Recommend Favorite

Subspace Clustering for High-Dimensional Data Using Cluster Structure Similarity

International Journal of Intelligent Information Technologies (IJIIT), Vol. 14, Iss. 3, 2018-07 ,pp. : 38-55

IGI Global_journal

Access to resources Recommend Favorite

Visual Exploration of High‐Dimensional Data through Subspace Analysis and Dynamic Projections

COMPUTER GRAPHICS FORUM (ELECTRONIC), Vol. 34, Iss. 3, 2015-06 ,pp. : 271-280

John Wiley & Sons Inc

Access to resources Recommend Favorite

An adaptive and dynamic dimensionality reduction method for high-dimensional indexing

By Shen Heng

The VLDB Journal, Vol. 16, Iss. 2, 2007-04 ,pp. : 219-234

Springer Publishing Company

Access to resources Recommend Favorite

The structure of logarithmic advice complexity classes

By Balcazar J.L. Hermo M.

Theoretical Computer Science, Vol. 207, Iss. 1, 1998-10 ,pp. : 217-244

Elsevier

Access to resources Recommend Favorite