Sciweavers

1722 search results - page 93 / 345
» On the sample mean of graphs
Sort
View
ACS
2000
15 years 6 months ago
Free Adjunction of Morphisms
Abstract. We develop a general setting for the treatment of extensions of categories by means of freely adjoined morphisms. To this end, we study what we call composition graphs, i...
Lutz Schröder, Horst Herrlich
ICDM
2010
IEEE
147views Data Mining» more  ICDM 2010»
15 years 4 months ago
Location and Scatter Matching for Dataset Shift in Text Mining
Dataset shift from the training data in a source domain to the data in a target domain poses a great challenge for many statistical learning methods. Most algorithms can be viewed ...
Bo Chen, Wai Lam, Ivor W. Tsang, Tak-Lam Wong
ENTCS
2006
172views more  ENTCS 2006»
15 years 6 months ago
Efficient Detection of Conflicts in Graph-based Model Transformation
Using graph transformation as a formalism to specify model transformation, termination and confluence of the graph transformation system are often required properties. Only under ...
Leen Lambers, Hartmut Ehrig, Fernando Orejas
ADC
2009
Springer
147views Database» more  ADC 2009»
16 years 27 days ago
The Effect of Sparsity on Collaborative Filtering Metrics
This paper presents a detailed study of the behavior of three different content-based collaborative filtering metrics (correlation, cosine and mean squared difference) when they a...
Jesús Bobadilla, Francisco Serradilla
NIPS
2000
15 years 7 months ago
Second Order Approximations for Probability Models
In this paper, we derive a second order mean field theory for directed graphical probability models. By using an information theoretic argument it is shown how this can be done in...
Hilbert J. Kappen, Wim Wiegerinck