Sciweavers

917 search results - page 150 / 184
» Mining interesting sets and rules in relational databases
Sort
View
ICDM
2010
IEEE
135views Data Mining» more  ICDM 2010»
13 years 5 months ago
Learning a Bi-Stochastic Data Similarity Matrix
An idealized clustering algorithm seeks to learn a cluster-adjacency matrix such that, if two data points belong to the same cluster, the corresponding entry would be 1; otherwise ...
Fei Wang, Ping Li, Arnd Christian König
SIGIR
2003
ACM
14 years 29 days ago
Collaborative filtering via gaussian probabilistic latent semantic analysis
Collaborative filtering aims at learning predictive models of user preferences, interests or behavior from community data, i.e. a database of available user preferences. In this ...
Thomas Hofmann
CIE
2010
Springer
14 years 16 days ago
Focusing in Asynchronous Games
Game semantics provides an interactive point of view on proofs, which enables one to describe precisely their dynamical behavior during cut elimination, by considering formulas as ...
Samuel Mimram
ICWN
2008
13 years 9 months ago
Progressive Content-Sensitive Data Retrieval in Sensor Networks
: Problem statement: For a sensor network comprising autonomous and self-organizing data sources, efficient similarity-based search for semantic-rich resources (such as video data)...
Bo Yang, Mareboyana Manohar, Shaoying Kou
CORR
2011
Springer
135views Education» more  CORR 2011»
12 years 11 months ago
On the Limitations of Provenance for Queries With Difference
The annotation of the results of database transformations was shown to be very effective for various applications. Until recently, most works in this context focused on positive q...
Yael Amsterdamer, Daniel Deutch, Val Tannen