Sciweavers

1487 search results - page 193 / 298
» Representing and Querying Data Transformations
Sort
View
ICDM
2007
IEEE
184views Data Mining» more  ICDM 2007»
15 years 8 months ago
Bayesian Folding-In with Dirichlet Kernels for PLSI
Probabilistic latent semantic indexing (PLSI) represents documents of a collection as mixture proportions of latent topics, which are learned from the collection by an expectation...
Alexander Hinneburg, Hans-Henning Gabriel, Andr&eg...
TCS
2011
14 years 8 months ago
Two faces of active learning
An active learner has a collection of data points, each with a label that is initially hidden but can be obtained at some cost. Without spending too much, it wishes to find a cla...
Sanjoy Dasgupta
128
Voted
JCIT
2010
115views more  JCIT 2010»
14 years 8 months ago
Metadata Version Management for DW 2, 0 Environment
As a new paradigm for data warehousing demanded by today's decision support community, DW 2.0 recognized the life cycle of data with it, that make metadata evolution mechanis...
Ding Pan
ICDE
2009
IEEE
251views Database» more  ICDE 2009»
16 years 3 months ago
Contextual Ranking of Keywords Using Click Data
The problem of automatically extracting the most interesting and relevant keyword phrases in a document has been studied extensively as it is crucial for a number of applications. ...
Utku Irmak, Vadim von Brzeski, Reiner Kraft
TKDE
2010
184views more  TKDE 2010»
15 years 3 days ago
The Dynamic Bloom Filters
—A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter a...
Deke Guo, Jie Wu, Honghui Chen, Ye Yuan, Xueshan L...