Sciweavers

SEMWEB
2007
Springer
13 years 11 months ago
Exploiting WordNet as Background Knowledge
A lot of alignment systems providing mappings between the concepts of two ontologies rely on an additional source, called background knowledge, represented most of the time by a th...
Chantal Reynaud, Brigitte Safar
ILP
2007
Springer
13 years 11 months ago
Learning with Kernels and Logical Representations
In this chapter, we describe a view of statistical learning in the inductive logic programming setting based on kernel methods. The relational representation of data and background...
Paolo Frasconi
CBMS
2007
IEEE
13 years 11 months ago
Increasing Acceptability of Decision Trees with Domain Attributes Partial Orders
There are several domains, such as health-care, in which the decision process usually has a background knowledge that must be considered. We need to maximize the accuracy of the m...
Joan Albert López-Vallverdú, David R...
SP
2008
IEEE
13 years 11 months ago
Robust De-anonymization of Large Sparse Datasets
We present a new class of statistical deanonymization attacks against high-dimensional micro-data, such as individual preferences, recommendations, transaction records and so on. ...
Arvind Narayanan, Vitaly Shmatikov
SEMWEB
2009
Springer
13 years 11 months ago
KOSIMap: Ontology Alignments Results for OAEI 2009
Abstract. Ontology mapping has been recognised as an important approach to identifying similar information in heterogeneous ontologies. The Knowledge Organisation System Implicit M...
Quentin Reul, Jeff Z. Pan
ICEIS
2009
IEEE
13 years 11 months ago
NARFO Algorithm: Mining Non-redundant and Generalized Association Rules Based on Fuzzy Ontologies
Traditional approaches for mining generalized association rules are based only on database contents, and focus on exact matches among items. However, in many applications, the use ...
Rafael Garcia Miani, Cristiane A. Yaguinuma, Maril...
SAC
2010
ACM
13 years 11 months ago
Background knowledge in formal concept analysis: constraints via closure operators
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...
Radim Belohlávek, Vilém Vychodil
KDD
2008
ACM
162views Data Mining» more  KDD 2008»
14 years 5 months ago
Composition attacks and auxiliary information in data privacy
Privacy is an increasingly important aspect of data publishing. Reasoning about privacy, however, is fraught with pitfalls. One of the most significant is the auxiliary informatio...
Srivatsava Ranjit Ganta, Shiva Prasad Kasiviswanat...
WWW
2007
ACM
14 years 5 months ago
Altering document term vectors for classification: ontologies as expectations of co-occurrence
In this paper we extend the state-of-the-art in utilizing background knowledge for supervised classification by exploiting the semantic relationships between terms explicated in O...
Meenakshi Nagarajan, Amit P. Sheth, Marcos Kawazoe...
ICDE
2007
IEEE
198views Database» more  ICDE 2007»
14 years 6 months ago
Worst-Case Background Knowledge for Privacy-Preserving Data Publishing
Recent work has shown the necessity of considering an attacker's background knowledge when reasoning about privacy in data publishing. However, in practice, the data publishe...
David J. Martin, Daniel Kifer, Ashwin Machanavajjh...