Sciweavers

160 search results - page 5 / 32
» Highly Scalable Rough Set Reducts Generation
Sort
View
VISSYM
2003
13 years 11 months ago
Visual Hierarchical Dimension Reduction for Exploration of High Dimensional Datasets
Traditional visualization techniques for multidimensional data sets, such as parallel coordinates, glyphs, and scatterplot matrices, do not scale well to high numbers of dimension...
Jing Yang, Matthew O. Ward, Elke A. Rundensteiner,...
PR
2006
87views more  PR 2006»
13 years 9 months ago
Prototype reduction schemes applicable for non-stationary data sets
All of the prototype reduction schemes (PRS) which have been reported in the literature, process time-invariant data to yield a subset of prototypes that are useful in nearest-nei...
Sang-Woon Kim, B. John Oommen
ICCAD
2005
IEEE
90views Hardware» more  ICCAD 2005»
14 years 6 months ago
Scalable compositional minimization via static analysis
State-equivalence based reduction techniques, e.g. bisimulation minimization, can be used to reduce a state transition system to facilitate subsequent verification tasks. However...
Fadi A. Zaraket, Jason Baumgartner, Adnan Aziz
ISMIS
2005
Springer
14 years 3 months ago
Scalable Inductive Learning on Partitioned Data
With the rapid advancement of information technology, scalability has become a necessity for learning algorithms to deal with large, real-world data repositories. In this paper, sc...
Qijun Chen, Xindong Wu, Xingquan Zhu
DASFAA
2010
IEEE
139views Database» more  DASFAA 2010»
14 years 4 months ago
Highly Scalable Multiprocessing Algorithms for Preference-Based Database Retrieval
Abstract. Until recently algorithms continuously gained free performance improvements due to ever increasing processor speeds. Unfortunately, this development has reached its limit...
Joachim Selke, Christoph Lofi, Wolf-Tilo Balke