2512 search results - page 303 / 503 » Learning from Highly Structured Data by Decomposition |
141
click to vote
CIDM
2009
IEEE
15 years 8 months ago
2009
IEEE
The graph classification problem is learning to classify separate, individual graphs in a graph database into two or more categories. A number of algorithms have been introduced fo...
143
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
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 ...
103
click to vote
ECSQARU
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. The K2 metric is a well-known evaluation measure (or scoring function) for learning Bayesian networks from data [7]. It is derived by assuming uniform prior distributions...
159
click to vote
AAAI
2010
15 years 23 days ago
2010
Dimensionality reduction plays an important role in many machine learning and pattern recognition tasks. In this paper, we present a novel dimensionality reduction algorithm calle...
152
click to vote
PODS
2003
ACM
16 years 4 months ago
2003
ACM
There has been increasing interest in the problem of building accurate data mining models over aggregate data, while protecting privacy at the level of individual records. One app...