Sciweavers

1403 search results - page 45 / 281
» Set cover algorithms for very large datasets
Sort
View
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 9 months ago
Dense itemsets
Frequent itemset mining has been the subject of a lot of work in data mining research ever since association rules were introduced. In this paper we address a problem with frequen...
Heikki Mannila, Jouni K. Seppänen
ECCV
2010
Springer
14 years 1 months ago
Localizing Objects while Learning Their Appearance
Learning a new object class from cluttered training images is very challenging when the location of object instances is unknown. Previous works generally require objects covering a...
IJCNN
2006
IEEE
14 years 2 months ago
Training of Large-Scale Feed-Forward Neural Networks
Abstract— Neural processing of large-scale data sets containing both many input / output variables and a large number of training examples often leads to very large networks. Onc...
Udo Seiffert
ADBIS
2009
Springer
162views Database» more  ADBIS 2009»
14 years 15 days ago
Efficient Set Similarity Joins Using Min-prefixes
Identification of all objects in a dataset whose similarity is not less than a specified threshold is of major importance for management, search, and analysis of data. Set similari...
Leonardo Ribeiro, Theo Härder
BMCBI
2010
151views more  BMCBI 2010»
13 years 8 months ago
Misty Mountain clustering: application to fast unsupervised flow cytometry gating
Background: There are many important clustering questions in computational biology for which no satisfactory method exists. Automated clustering algorithms, when applied to large,...
István P. Sugár, Stuart C. Sealfon