2383 search results - page 13 / 477 » Finding Representative Set from Massive Data |
FBIT
2007
IEEE
15 years 4 months ago
2007
IEEE
This paper describes a decision tree model and 3dimensional representation of information retrieved from various weblogs in relation to argumentative logics. The weblogs are consi...
PSSS
2003
14 years 11 months ago
2003
: RDF-based tools promise to provide a base for reasoning about metadata and about situated data—data describing entities situated in time and space—that is superior to alterna...
107
click to vote
EDBT
2011
ACM
14 years 1 months ago
2011
ACM
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
VC
2008
14 years 9 months ago
2008
We present an adaptive out-of-core technique for rendering massive scalar volumes employing single pass GPU raycasting. The method is based on the decomposition of a volumetric dat...
TKDE
2008
14 years 9 months ago
2008
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...