Sciweavers

728 search results - page 11 / 146
» Mining for Empty Rectangles in Large Data Sets
Sort
View
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
14 years 9 months ago
Similarity Search in Sets and Categorical Data Using the Signature Tree
Data mining applications analyze large collections of set data and high dimensional categorical data. Search on these data types is not restricted to the classic problems of minin...
Nikos Mamoulis, David W. Cheung, Wang Lian
CORR
2011
Springer
222views Education» more  CORR 2011»
12 years 11 months ago
A New Data Layout For Set Intersection on GPUs
Abstract—Set intersection is the core in a variety of problems, e.g. frequent itemset mining and sparse boolean matrix multiplication. It is well-known that large speed gains can...
Rasmus Resen Amossen, Rasmus Pagh
SDM
2004
SIAM
211views Data Mining» more  SDM 2004»
13 years 9 months ago
Using Support Vector Machines for Classifying Large Sets of Multi-Represented Objects
Databases are a key technology for molecular biology which is a very data intensive discipline. Since molecular biological databases are rather heterogeneous, unification and data...
Hans-Peter Kriegel, Peer Kröger, Alexey Pryak...
ICDM
2003
IEEE
115views Data Mining» more  ICDM 2003»
14 years 28 days ago
Icon-based Visualization of Large High-Dimensional Datasets
High dimensional data visualization is critical to data analysts since it gives a direct view of original data. We present a method to visualize large amount of high dimensional d...
Ping Chen, Chenyi Hu, Wei Ding 0003, Heloise Lynn,...
PRL
2002
67views more  PRL 2002»
13 years 7 months ago
A pseudo-nearest-neighbor approach for missing data recovery on Gaussian random data sets
Missing data handling is an important preparation step for most data discrimination or mining tasks. Inappropriate treatment of missing data may cause large errors or false result...
Xiaolu Huang, Qiuming Zhu