Sciweavers

1403 search results - page 167 / 281
» Set cover algorithms for very large datasets
Sort
View
182
Voted
BMCBI
2007
143views more  BMCBI 2007»
15 years 6 months ago
RNAspa: a shortest path approach for comparative prediction of the secondary structure of ncRNA molecules
Background: In recent years, RNA molecules that are not translated into proteins (ncRNAs) have drawn a great deal of attention, as they were shown to be involved in many cellular ...
Yair Horesh, Tirza Doniger, Shulamit Michaeli, Ron...
ERSHOV
2006
Springer
15 years 9 months ago
On the Importance of Parameter Tuning in Text Categorization
Abstract. Text Categorization algorithms have a large number of parameters that determine their behaviour, whose effect is not easily predicted objectively or intuitively and may v...
Cornelis H. A. Koster, Jean Beney
190
Voted
KAIS
2006
164views more  KAIS 2006»
15 years 6 months ago
On efficiently summarizing categorical databases
Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its a...
Jianyong Wang, George Karypis
172
Voted
SDM
2007
SIAM
118views Data Mining» more  SDM 2007»
15 years 7 months ago
On Privacy-Preservation of Text and Sparse Binary Data with Sketches
In recent years, privacy preserving data mining has become very important because of the proliferation of large amounts of data on the internet. Many data sets are inherently high...
Charu C. Aggarwal, Philip S. Yu
VISUALIZATION
2000
IEEE
15 years 10 months ago
On-the-Fly rendering of losslessly compressed irregular volume data
Very large irregular-grid data sets are represented as tetrahedral meshes and may incur significant disk I/O access overhead in the rendering process. An effective way to allevia...
Chuan-Kai Yang, Tulika Mitra, Tzi-cker Chiueh