2012 IEEE 12th International Conference on Data Mining 2012
DOI: 10.1109/icdm.2012.22
|View full text |Cite
|
Sign up to set email alerts
|

Hashing with Generalized Nyström Approximation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 14 publications
0
3
0
Order By: Relevance
“…Previous studies have disclosed that MVF is an appropriate method to analyze historic price data especially on the occasion when a variety of countries, regions and industries are examined (Pukthuanthong and Roll, 2009). Linear dimensionality reduction by means of MVF is built on leading eigenvectors of data covariance (Yun et al , 2012). If cost indices of all samples have high relevance, CCIs for a country/region can be treated as a signal based on the principle of maximum variance theory.…”
Section: Methodsmentioning
confidence: 99%
“…Previous studies have disclosed that MVF is an appropriate method to analyze historic price data especially on the occasion when a variety of countries, regions and industries are examined (Pukthuanthong and Roll, 2009). Linear dimensionality reduction by means of MVF is built on leading eigenvectors of data covariance (Yun et al , 2012). If cost indices of all samples have high relevance, CCIs for a country/region can be treated as a signal based on the principle of maximum variance theory.…”
Section: Methodsmentioning
confidence: 99%
“…• CIFAR [22,32]: a labeled subset of the 80 million tiny images dataset, containing 60,000 images, each described by 3072 features (a 32x32 RGB pixel image).…”
Section: Datamentioning
confidence: 99%
“…These data-independent method produce more generalized encodings, but tend to need long codes because they are randomly selected and do not con- sider the distribution of the data. In contrast, datadependent methods that consider the neighbor structure of the data points are able to obtain more compact binary codes (e.g., Restricted Boltzmann Machines (RBMs) [7], spectral hashing [5], PCA hashing [18], spherical hashing [11], kmeans-hashing [13], semi-supervised hashing [19,20], and iterative quantization [21,22]). …”
Section: Introductionmentioning
confidence: 99%