Sciweavers

3212 search results - page 369 / 643
» Faster Concept Analysis
Sort
View
JCST
2008
119views more  JCST 2008»
15 years 5 months ago
Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...
Daniel Kunkle, Donghui Zhang, Gene Cooperman
BMCBI
2011
14 years 12 months ago
A comparison and user-based evaluation of models of textual information structure in the context of cancer risk assessment
Background: Many practical tasks in biomedicine require accessing specific types of information in scientific literature; e.g. information about the results or conclusions of the ...
Yufan Guo, Anna Korhonen, Maria Liakata, Ilona Sil...
187
Voted
SIGCOMM
2012
ACM
13 years 7 months ago
HyperDex: a distributed, searchable key-value store
Distributed key-value stores are now a standard component of high-performance web services and cloud computing applications. While key-value stores offer significant performance...
Robert Escriva, Bernard Wong, Emin Gün Sirer
RECOMB
2002
Springer
16 years 5 months ago
Monotony of surprise and large-scale quest for unusual words
The problem of characterizing and detecting recurrent sequence patterns such as substrings or motifs and related associations or rules is variously pursued in order to compress da...
Alberto Apostolico, Mary Ellen Bock, Stefano Lonar...
ICFP
2004
ACM
16 years 4 months ago
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
Harry G. Mairson, Peter Møller Neergaard