Semantic sampling of existing databases through informative Armstrong databases

Marchi, Fabien De; Petit, Jean-Marc

doi:10.1016/j.is.2005.12.007

Cited by 29 publications

(28 citation statements)

References 25 publications

(42 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are other representations using many-valued relations which may be more compact as our representation, but they use other reconstruction algorithms (see for example, minimal Armstrong relation in Database area [4,8]). Beeri et al [4] show that any lattice L can be encoded using a minimal Armstrong relation which contains at least dð1 þ ffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffi 1 þ 8:jMðLÞj p Þ=2e rows and at most jMðLÞj þ 1 rows.…”

Section: Resultsmentioning

confidence: 99%

Representing lattices using many-valued relations

Gély¹,

Medina²,

Nourine³

2009

Information Sciences

View full text Add to dashboard Cite

Section: Resultsmentioning

confidence: 99%

Representing lattices using many-valued relations

Gély¹,

Medina²,

Nourine³

2009

Information Sciences

View full text Add to dashboard Cite

“…Many of these works mostly target the efficiency and accuracy of database operations through statistical techniques (Olken and Rotem, 1986;Lipton et al, 1993), or aim at semantic representation and understanding of a database (De Marchi and Petit, 2007). The latter research line is more related to our work because approaches in this field also aim to obtain a compact subschema.…”

Section: Related Workmentioning

confidence: 99%

Reducing the size of databases for multirelational classification: a subgraph-based approach

2012

View full text Add to dashboard Cite

/npsi/ctrl?lang=en http://nparc.cisti-icist.nrc-cnrc.gc.ca/npsi/ctrl?lang=fr Access and use of this website and the material on it are subject to the Terms and Conditions set forth at http://nparc.cisti-icist.nrc-cnrc.gc.ca/npsi/jsp/nparc_cp.jsp?lang=en NRC Publications Archive Archives des publications du CNRCThis publication could be one of several versions: author's original, accepted manuscript or the publisher's version. / La version de cette publication peut être l'une des suivantes : la version prépublication de l'auteur, la version acceptée du manuscrit ou la version de l'éditeur. For the publisher's version, please access the DOI link below./ Pour consulter la version de l'éditeur, utilisez le lien DOI ci-dessous.http://dx.doi.org/10.1007/s10844-012-0229-0 Systems, November 2012, 2012 Reducing the size of databases for multirelational classification : a subgraph-based approach Guo, Hongyu; Viktor, Herna L.; Paquet, Eric Abstract Multirelational classification aims to discover patterns across multiple interlinked tables (relations) in a relational database. In many large organizations, such a database often spans numerous departments and/or subdivisions, which are involved in different aspects of the enterprise such as customer profiling, fraud detection, inventory management, financial management, and so on. When considering classification, different phases of the knowledge discovery process are affected by economic utility. For instance, in the data preprocessing process, one must consider the cost associated with acquiring, cleaning, and transforming large volumes of data. When training and testing the data mining models, one has to consider the impact of the data size on the running time of the learning algorithm. In order to address these utility-based issues, the paper presents an approach to create a pruned database for multirelational classification, while minimizing predictive performance loss on the final model. Our method identifies a set of strongly uncorrelated subgraphs from the original database schema, to use for training, and discards all others. The experiments performed show that our strategy is able to, without sacrificing predictive accuracy, significantly reduce the size of the databases, in terms of the number of relations, tuples, and attributes. The approach prunes the sizes of databases by as much as 94%. Such reduction also results in decreasing computational cost of the learning process. The method improves the multirelational learning algorithms' execution time by as much as 80%. In particular, our results demonstrate that one may build an accurate model with only a small subset of the provided database. Journal of Intelligent Information

show abstract

“…Recently, the concept of Armstrong databases was extended to so-called informative Armstrong databases [14,73,74]. These are subsets of existing database relations that satisfy precisely the same set of FDs and inclusion dependencies that are satisfied by the entire relations in the database.…”

Section: Related Work and Motivationmentioning

confidence: 99%

“…These Total 00723 389 Microwave 10 5000 00724 389 Microwave 10 5000 00724 521 Microwave 10 5000 00724 521 Oven 10 5000 00724 521 Oven 20 5000 00724 521 Oven 20 8000 interpretations of ''useful'' have received considerable interest from the research community, e.g. [9,[12][13][14].…”

Section: Introductionmentioning

confidence: 99%