Sciweavers

915 search results - page 76 / 183
» Maximally Abstract Retrenchments
Sort
View
ECML
2007
Springer
14 years 2 months ago
Conceptual Clustering Applied to Ontologies
Abstract. A clustering method is presented which can be applied to semantically annotated resources in the context of ontological knowledge bases. This method can be used to discov...
Floriana Esposito, Nicola Fanizzi, Claudia d'Amato
ICA
2007
Springer
14 years 2 months ago
Sparse Component Analysis in Presence of Noise Using an Iterative EM-MAP Algorithm
Abstract. In this paper, a new algorithm for source recovery in underdetermined Sparse Component Analysis (SCA) or atomic decomposition on over-complete dictionaries is presented i...
Hadi Zayyani, Massoud Babaie-Zadeh, G. Hosein Mohi...
IH
2007
Springer
14 years 2 months ago
A Fusion of Maximum Likelihood and Structural Steganalysis
Abstract. This paper draws together two methodologies for the detection of bit replacement steganography: the principle of maximum likelihood, which is statistically well-founded b...
Andrew D. Ker
PKDD
2007
Springer
214views Data Mining» more  PKDD 2007»
14 years 2 months ago
Multi-party, Privacy-Preserving Distributed Data Mining Using a Game Theoretic Framework
Abstract. Analysis of privacy-sensitive data in a multi-party environment often assumes that the parties are well-behaved and they abide by the protocols. Parties compute whatever ...
Hillol Kargupta, Kamalika Das, Kun Liu
SUM
2007
Springer
14 years 2 months ago
Finding Most Probable Worlds of Probabilistic Logic Programs
Abstract. Probabilistic logic programs have primarily studied the problem of entailment of probabilistic atoms. However, there are some interesting applications where we are intere...
Samir Khuller, Maria Vanina Martinez, Dana S. Nau,...