Sciweavers

1314 search results - page 164 / 263
» Approximate data mining in very large relational data
Sort
View
ICDE
2001
IEEE
163views Database» more  ICDE 2001»
16 years 5 months ago
MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases
We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very lon...
Douglas Burdick, Manuel Calimlim, Johannes Gehrke
ICPR
2006
IEEE
16 years 5 months ago
Linear model combining by optimizing the Area under the ROC curve
In some classification problems, like the detection of illnesses in patients, classes are very unbalanced and the misclassification costs for different classes vary significantly....
David M. J. Tax, Robert P. W. Duin
GIS
2008
ACM
15 years 4 months ago
Spatially enabling governments through SDI implementation
Spatially enabled government requires the development of effective SDIs that will support the vast majority of society, who are not spatially aware, in a transparent manner. This ...
Ian Masser, Abbas Rajabifard, Ian P. Williamson
FAST
2011
14 years 8 months ago
A Study of Practical Deduplication
We collected file system content data from 857 desktop computers at Microsoft over a span of 4 weeks. We analyzed the data to determine the relative efficacy of data deduplication...
Dutch T. Meyer, William J. Bolosky
CIKM
2010
Springer
15 years 3 months ago
Decomposing background topics from keywords by principal component pursuit
Low-dimensional topic models have been proven very useful for modeling a large corpus of documents that share a relatively small number of topics. Dimensionality reduction tools s...
Kerui Min, Zhengdong Zhang, John Wright, Yi Ma