Décomposition Rectangulaire Optimale D’une Relation Binaire: Application Aux Bases De Données Documentaires

Belkhiter, Nadir; Bourhfir, C.; Gammoudi, Mohamed Mohsen; Jaoua, Ali; Thanh, N. Le; Reguig, M.

doi:10.1080/03155986.1994.11732236

Cited by 17 publications

(4 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In graph theory, a maximal bipartite graph was exploited in the thesis of Le Than in 1986 [15] in a database to introduce a new kind of dependencies called 'Iso-dependencies', independently, Jaoua et al introduced difunctional dependencies as the most suitable name for iso-dependencies in a database [16]. The most recent mathematical studies about formal concept analysis have been done by Ganter and Wille.…”

Section: Definition Of a Formal Conceptmentioning

confidence: 99%

See 1 more Smart Citation

Conceptual Data Classification: Application for Knowledge Extraction

Hasnah¹,

Jaoua²,

Ja’am³

2005

Computer‐Aided Intelligent Recognition Techniques and Applications

View full text Add to dashboard Cite

Section: Definition Of a Formal Conceptmentioning

confidence: 99%

“…The search for a set of optimal rectangles that provides a coverage of a given relation R can be made through the following steps [15]:…”

Section: An Approximate Algorithm For Minimal Coverage Of a Binary Comentioning

confidence: 99%

Conceptual Data Classification: Application for Knowledge Extraction

Hasnah¹,

Jaoua²,

Ja’am³

2005

Computer‐Aided Intelligent Recognition Techniques and Applications

View full text Add to dashboard Cite

“…The main concept used for thesaurus construction is the binary relation. A binary relation can be decomposed in a minimal set of optimal rectangles by the method of Rectangular Decomposition of a Binary Relation [6,3]. The extraction of rectangles from a finite binary relation has been extensively studied in the context of Lattice Theory and has proven to be very useful in many computer science applications.. A rectangle of a binary relation R is a pair of sets (A, B) such that A × B ⊆ R. More precisely…”

Section: Rectangular Thesaurus: Basic Conceptsmentioning

confidence: 99%

Semi-automatic indexing of documents with a multilingual thesaurus

Schiel

Sousa

Proceedings. Seventeenth Workshop on Parallel and Distributed Simulation

View full text Add to dashboard Cite

With the growing signzjicance of digital libraries and the Internet, more and more electronic texts become accessible to a wide and geographically disperse public. This requires adequate tools to facilitate indexing, storage, and retrieval of documents written in different languages. We present a method f o r semiautomatic indexing of electronic documents and construction of a multilingual thesaurus, which can be used for query formulation and information retrieval. We use special dictionaries m d user interaction in order to solve ambiguities andjnd adequate canonical terms in the language and an adequate abstract language-independent term. n e abstract thesaurus is updated incrementally by new indexed documents and is used to search for documents using adequate terms

show abstract

“…The main concept used for thesaurus construction is the binary relation. A binary relation can be decomposed in a minimal set of optimal rectangles by the method of Rectangular Decomposition of a Binary Relation [Ga93,BBG94]. The extraction of rectangles from a finite binary relation has been extensively studied in the context of Lattice Theory and has proven to be very useful in many computer science applications..…”

Section: Rectangular Thesaurus: Basic Conceptsmentioning

confidence: 99%

Interactive Indexing of Documents with a Multilingual Thesaurus

Schiel

Sousa

Effective Databases for Text &Amp; Document Management

View full text Add to dashboard Cite

With the growing significance of digital libraries and the Internet, more and more electronic texts become accessible to a wide and geographically disperse public. This requires adequate tools to facilitate indexing, storage, and retrieval of documents written in different languages. We present a method for semi-automatic indexing of electronic documents and construction of a multilingual thesaurus, which can be used for query formulation and information retrieval. We use special dictionaries and user interaction in order to solve ambiguities and find adequate canonical terms in the language and an adequate abstract language-independent term. The abstract thesaurus is updated incrementally by new indexed documents and is used to search for documents using adequate terms.

show abstract

Décomposition Rectangulaire Optimale D’une Relation Binaire: Application Aux Bases De Données Documentaires

Cited by 17 publications

References 0 publications

Conceptual Data Classification: Application for Knowledge Extraction

Conceptual Data Classification: Application for Knowledge Extraction

Semi-automatic indexing of documents with a multilingual thesaurus

Interactive Indexing of Documents with a Multilingual Thesaurus

Contact Info

Product

Resources

About