Sciweavers

446 search results - page 57 / 90
» Learning discrete categorial grammars from structures
Sort
View
GECCO
2006
Springer
158views Optimization» more  GECCO 2006»
13 years 11 months ago
Properties of symmetric fitness functions
The properties of symmetric fitness functions are investigated. We show that a well-known encoding scheme inducing symmetric functions has the non-synonymous property and the sear...
Sung-Soon Choi, Yung-Keun Kwon, Byung Ro Moon
KDD
2008
ACM
244views Data Mining» more  KDD 2008»
14 years 8 months ago
Probabilistic latent semantic visualization: topic model for visualizing documents
We propose a visualization method based on a topic model for discrete data such as documents. Unlike conventional visualization methods based on pairwise distances such as multi-d...
Tomoharu Iwata, Takeshi Yamada, Naonori Ueda
ATAL
2008
Springer
13 years 9 months ago
A statistical relational model for trust learning
We address the learning of trust based on past observations and context information. We argue that from the truster's point of view trust is best expressed as one of several ...
Achim Rettinger, Matthias Nickles, Volker Tresp
COMPGEOM
2011
ACM
12 years 11 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...
COMPGEOM
2009
ACM
14 years 2 months ago
Near-linear approximation algorithms for geometric hitting sets
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
Pankaj K. Agarwal, Esther Ezra, Micha Sharir