SubSpace Projection: A unified framework for a class of partition-based dimension reduction techniques

Boundary-based lower-bound functions for dynamic time warping and their indexing

“…Second, besides the traditional application of lower-bound functions in static indexing and searching, currently we are exploring the possibility of building a dynamic index based on the proposed lower-bound functions in stream data. Third, in [2] the authors propose a new dimensionality reduction technique that is better than PAA, which is currently used in our work. We can apply this technique to further improve the performance of our method.…”

Evolutionary compact embedding for large-scale image classification

“…Dimensionality reduction has been a critical preprocessing step in many fields of information processing and analysis, such as data mining [5,12,[18][19][20], information retrieval [14,16], and pattern recognition [11,21,29,37]. Recently, with the advances of computer technologies and the development of the World Wide Web, a huge amount of digital data, including text, images and videos, is generated, stored, analyzed, and accessed every day.…”

Incremental maximum margin criterion based on eigenvalue decomposition updating algorithm

“…Face recognition [1][2][3][4][5][6] has been an active research area in computer vision and pattern recognition communities in the last decades. Since two-dimensional face images are usu-B Gui-Fu Lu luguifu_tougao@163.com 1 School of Computer and Information, Anhui Polytechnic University, Wuhu 241000, Anhui, China ally transformed into one-dimensional vectors via column by column or row by row concatenation in face recognition, the original input-image space has a very high dimension and a dimensionality reduction technique is usually employed to solve the high-dimensionality problem.…”