Sciweavers

244 search results - page 10 / 49
» Efficient Approximation Algorithms for Repairing Inconsisten...
Sort
View
VLSISP
2002
139views more  VLSISP 2002»
13 years 8 months ago
A Modified Minimum Classification Error (MCE) Training Algorithm for Dimensionality Reduction
Dimensionality reduction is an important problem in pattern recognition. There is a tendency of using more and more features to improve the performance of classifiers. However, not...
Xuechuan Wang, Kuldip K. Paliwal
KDD
2008
ACM
104views Data Mining» more  KDD 2008»
14 years 8 months ago
Succinct summarization of transactional databases: an overlapped hyperrectangle scheme
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...
Yang Xiang, Ruoming Jin, David Fuhry, Feodor F. Dr...
ADBIS
1994
Springer
87views Database» more  ADBIS 1994»
14 years 16 days ago
Variations of R-Tree Structure for Indexing of Spatial Objects
The data structures suitable for indexing of large spatial objects in databases are considered. Some generalizations of existing tree methods concerned approximation of spatial ob...
M. G. Martynov
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
14 years 8 months ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen
DEXA
2008
Springer
155views Database» more  DEXA 2008»
13 years 10 months ago
NM-Tree: Flexible Approximate Similarity Search in Metric and Non-metric Spaces
So far, an efficient similarity search in multimedia databases has been carried out by metric access methods (MAMs), where the utilized similarity measure had to satisfy the metric...
Tomás Skopal, Jakub Lokoc