Sciweavers

425 search results - page 15 / 85
» Polynomial Time Data Reduction for Dominating Set
Sort
View
91
Voted
CCGRID
2010
IEEE
14 years 10 months ago
High Performance Dimension Reduction and Visualization for Large High-Dimensional Data Analysis
Abstract--Large high dimension datasets are of growing importance in many fields and it is important to be able to visualize them for understanding the results of data mining appro...
Jong Youl Choi, Seung-Hee Bae, Xiaohong Qiu, Geoff...
KAIS
2000
86views more  KAIS 2000»
14 years 9 months ago
A Mathematical Foundation for Improved Reduct Generation in Information Systems
When data sets are analyzed, statistical pattern recognition is often used to find the information hidden in the data. Another approach to information discovery is data mining. Dat...
Janusz A. Starzyk, Dale E. Nelson, Kirk Sturtz
TJS
2002
83views more  TJS 2002»
14 years 9 months ago
An I/O-Conscious Tiling Strategy for Disk-Resident Data Sets
This paper describes a tiling technique that can be used by application programmers and optimizing compilers to obtain I/O-efficient versions of regular scientific loop nests. Due ...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
ICDM
2005
IEEE
135views Data Mining» more  ICDM 2005»
15 years 3 months ago
Bit Reduction Support Vector Machine
Abstract— Support vector machines are very accurate classifiers and have been widely used in many applications. However, the training and to a lesser extent prediction time of s...
Tong Luo, Lawrence O. Hall, Dmitry B. Goldgof, And...
SIGMOD
2004
ACM
126views Database» more  SIGMOD 2004»
15 years 9 months ago
Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
Yuhan Cai, Raymond T. Ng