2016 International Conference on Electrical, Electronics, and Optimization Techniques (ICEEOT) 2016
DOI: 10.1109/iceeot.2016.7754940
|View full text |Cite
|
Sign up to set email alerts
|

Large high dimensional data handling using data reduction

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
3
0
1

Year Published

2019
2019
2023
2023

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 13 publications
0
3
0
1
Order By: Relevance
“…The vector representation of the words defines the position of each word in a high dimensional space, typically 100 to 500 dimensions. However, high-dimensional data is hard to visualize making it hard to identify what words similar to each other (Patel, 2016). Dimensionality reduction techniques reveal the underlying structure of the data.…”
Section: A Primer On Text Analysismentioning
confidence: 99%
“…The vector representation of the words defines the position of each word in a high dimensional space, typically 100 to 500 dimensions. However, high-dimensional data is hard to visualize making it hard to identify what words similar to each other (Patel, 2016). Dimensionality reduction techniques reveal the underlying structure of the data.…”
Section: A Primer On Text Analysismentioning
confidence: 99%
“…Чим менше часу витрачається на очікування, тим більш ефективна робота вебзастосунку [1][2][3][4]. У роботі [5] розглядаються такі методи, як використання файлів cookie, зберігання сеансів, локальне зберігання та indexDB. Автори обговорюють переваги й обмеження кожного із цих підходів та їх ефективність.…”
Section: вступunclassified
“…The weighted k-nearest neighbor classifier was utilized to prove the importance of data reduction. After using uniform random sampling selection for data reduction in both direction-instances and attributes, accuracy is preserved, and an increase of execution time was observed [22].…”
Section: Rank-based Variable Minimization Using Clustering Algorithmmentioning
confidence: 99%