Robert Godin - Academia.edu (original) (raw)

Papers by Robert Godin

Research paper thumbnail of COLLABORATIVE OLAP WITH TAG CLOUDS - Web 2.0 OLAP Formalism and Experimental Evaluation

Research paper thumbnail of Vers de meilleures performances avec des Roaring bitmaps

Techniques et sciences informatiques, 2016

Research paper thumbnail of Formal Concept Analysis

Lecture Notes in Computer Science, 2005

Research paper thumbnail of Another nail to the coffin of faceted controlled-vocabulary component classification and retrieval

ACM SIGSOFT Software Engineering Notes, 1997

Research paper thumbnail of Building and maintaining analysis-level class hierarchies using Galois Lattices

ACM SIGPLAN Notices, 1993

Research paper thumbnail of Design of a browsing interface for information retrieval

ACM SIGIR Forum, 1989

In conventional Boolean retrieval systems, users have difficulty controlling the amount of output... more In conventional Boolean retrieval systems, users have difficulty controlling the amount of output obtained from a given query. This paper describes the design of a user interface which permits gradual enlargement or refinement of the user's query by browsing through a graph of term and document subsets. This graph is obtained from a lattice automatically generated from the usual document-term relation. The major design features of the proposed interface are the integration of menu, fill-in the blank and direct manipulation modes of interaction within the “fisheye view” [Furnas, 1986] paradigm. A prototype user interface incorporating some of these ideas has been implemented on a microcomputer. The resulting interface is well adapted to various kinds of users and needs. More experienced users with a particular subject in mind can directly specify a query which results into a jump to a particular vertex in the graph. From there, the user can refine his initial query by browsing th...

Research paper thumbnail of JEN: un algorithme efficace de construction de générateurs pour l'identification des règles d'association

Research paper thumbnail of On-line maintenance of iceberg concept lattices

Research paper thumbnail of Object-Oriented

Research paper thumbnail of A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes

Annals of Mathematics and Artificial Intelligence, 2013

Research paper thumbnail of Efficient Vertical Mining of Frequent Closures and Generators

Advances in Intelligent Data Analysis VIII, 2009

Research paper thumbnail of Applying Concept Formation Methods to Software Reuse

International Journal of Software Engineering and Knowledge Engineering, 1995

This paper describes an approach to software reuse that involves generating and retrieving abstra... more This paper describes an approach to software reuse that involves generating and retrieving abstractions from existing software systems using concept formation methods. The potential of the approach is illustrated through two important activities of the reuse process. First, the concept hierarchy generated by the concept formation methods is used for organizing and retrieving the artifacts inside a repository. Second, the generated concepts are used in identifying new abstractions that may be converted into new, more generic artifacts with better reuse potential. These experiments are part of a major software engineering research project involving many business and academic partners.

Research paper thumbnail of On Computing the Minimal Generator Family for Concept Lattices and Icebergs

Lecture Notes in Computer Science, 2005

Research paper thumbnail of A Note on Finitely Derived Information Systems

Electronic Notes in Theoretical Computer Science, 2014

Research paper thumbnail of Incremental Concept Formation Algorithms Based on Galois (Concept) Lattices

Computational Intelligence, 1995

Research paper thumbnail of Nouveaux modèles d'index bitmap compressés à 64 bits

Les index bitmap sont tres utilises dans les entrepots de donnees et moteurs de recherche pour ac... more Les index bitmap sont tres utilises dans les entrepots de donnees et moteurs de recherche pour accelerer les requetes d'interrogation. Leurs principaux avantages sont leur forme compacte et leur capacite a tirer profit du traitement parallele de bits dans les CPU (bit-level parallelism). Dans l'ere actuelle du Big Data, les collections de donnees deviennent de plus en plus volumineuses. Les librairies d'index bitmap compresses disponibles a ce jour dans la litterature, telles que : Roaring bitmap, WAH ou Concise, ne supportent qu'au plus 4 milliards d'entrees et sont tres souvent impraticables dans de tels contextes. Apres avoir constate ce besoin tant dans le milieu industriel que scientifique, nous proposons trois nouveaux modeles d'index bitmap compresses, bases sur le format de notre precedente contribution Roaring bitmap et qui supportent jusqu'a 2^64 entrees. Des experiences sur des donnees synthetiques ont ete mises en oeuvre pour comparer les perf...

Research paper thumbnail of Collaborative OLAP with Tag Clouds - Web 2.0 OLAP Formalism and Experimental Evaluation

ArXiv, 2008

Increasingly, business projects are ephemeral. New Business Intelligence tools must support ad-li... more Increasingly, business projects are ephemeral. New Business Intelligence tools must support ad-lib data sources and quick perusal. Meanwhile, tag clouds are a popular community-driven visualization technique. Hence, we investigate tag-cloud views with support for OLAP operations such as roll-ups, slices, dices, clustering, and drill-downs. As a case study, we implemented an application where users can upload data and immediately navigate through its ad hoc dimensions. To support social networking, views can be easily shared and embedded in other Web sites. Algorithmically, our tag-cloud views are approximate range top-k queries over spontaneous data cubes. We present experimental evidence that iceberg cuboids provide adequate online approximations. We benchmark several browser-oblivious tag-cloud layout optimizations.

Research paper thumbnail of Optimizing Druid with Roaring bitmaps

Proceedings of the 20th International Database Engineering & Applications Symposium on - IDEAS '16, 2016

Research paper thumbnail of Web 2.0 OLAP: From Data Cubes to Tag Clouds

Lecture Notes in Business Information Processing, 2009

Research paper thumbnail of Conceptual Modeling Using Conceptual Graphs

The next generation of task support systems aims at providing the relevant knowledge to knowledge... more The next generation of task support systems aims at providing the relevant knowledge to knowledge-dependent activities, reducing the effort required to find or infer this knowledge from the data. In order to exploit knowledge associated with (or embedded in) databases and to migrate from data to knowledge management environments, conceptual modeling languages must offer more expressiveness than traditional modeling languages. This paper proposes a well established knowledge representation language, the conceptual graph (CG) formalism, as such a conceptual modeling language. It shows through an example, that it is suited for that purpose, allowing great expressiveness and uniformity of representation, though remaining simple to use. Its graphical interface and closeness to well-established modeling formalisms like UML and the ER model should facilitate its understanding and therefore should ease its integration into the market place. Therefore this paper emphasizes this aspect of the...

Research paper thumbnail of COLLABORATIVE OLAP WITH TAG CLOUDS - Web 2.0 OLAP Formalism and Experimental Evaluation

Research paper thumbnail of Vers de meilleures performances avec des Roaring bitmaps

Techniques et sciences informatiques, 2016

Research paper thumbnail of Formal Concept Analysis

Lecture Notes in Computer Science, 2005

Research paper thumbnail of Another nail to the coffin of faceted controlled-vocabulary component classification and retrieval

ACM SIGSOFT Software Engineering Notes, 1997

Research paper thumbnail of Building and maintaining analysis-level class hierarchies using Galois Lattices

ACM SIGPLAN Notices, 1993

Research paper thumbnail of Design of a browsing interface for information retrieval

ACM SIGIR Forum, 1989

In conventional Boolean retrieval systems, users have difficulty controlling the amount of output... more In conventional Boolean retrieval systems, users have difficulty controlling the amount of output obtained from a given query. This paper describes the design of a user interface which permits gradual enlargement or refinement of the user's query by browsing through a graph of term and document subsets. This graph is obtained from a lattice automatically generated from the usual document-term relation. The major design features of the proposed interface are the integration of menu, fill-in the blank and direct manipulation modes of interaction within the “fisheye view” [Furnas, 1986] paradigm. A prototype user interface incorporating some of these ideas has been implemented on a microcomputer. The resulting interface is well adapted to various kinds of users and needs. More experienced users with a particular subject in mind can directly specify a query which results into a jump to a particular vertex in the graph. From there, the user can refine his initial query by browsing th...

Research paper thumbnail of JEN: un algorithme efficace de construction de générateurs pour l'identification des règles d'association

Research paper thumbnail of On-line maintenance of iceberg concept lattices

Research paper thumbnail of Object-Oriented

Research paper thumbnail of A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes

Annals of Mathematics and Artificial Intelligence, 2013

Research paper thumbnail of Efficient Vertical Mining of Frequent Closures and Generators

Advances in Intelligent Data Analysis VIII, 2009

Research paper thumbnail of Applying Concept Formation Methods to Software Reuse

International Journal of Software Engineering and Knowledge Engineering, 1995

This paper describes an approach to software reuse that involves generating and retrieving abstra... more This paper describes an approach to software reuse that involves generating and retrieving abstractions from existing software systems using concept formation methods. The potential of the approach is illustrated through two important activities of the reuse process. First, the concept hierarchy generated by the concept formation methods is used for organizing and retrieving the artifacts inside a repository. Second, the generated concepts are used in identifying new abstractions that may be converted into new, more generic artifacts with better reuse potential. These experiments are part of a major software engineering research project involving many business and academic partners.

Research paper thumbnail of On Computing the Minimal Generator Family for Concept Lattices and Icebergs

Lecture Notes in Computer Science, 2005

Research paper thumbnail of A Note on Finitely Derived Information Systems

Electronic Notes in Theoretical Computer Science, 2014

Research paper thumbnail of Incremental Concept Formation Algorithms Based on Galois (Concept) Lattices

Computational Intelligence, 1995

Research paper thumbnail of Nouveaux modèles d'index bitmap compressés à 64 bits

Les index bitmap sont tres utilises dans les entrepots de donnees et moteurs de recherche pour ac... more Les index bitmap sont tres utilises dans les entrepots de donnees et moteurs de recherche pour accelerer les requetes d'interrogation. Leurs principaux avantages sont leur forme compacte et leur capacite a tirer profit du traitement parallele de bits dans les CPU (bit-level parallelism). Dans l'ere actuelle du Big Data, les collections de donnees deviennent de plus en plus volumineuses. Les librairies d'index bitmap compresses disponibles a ce jour dans la litterature, telles que : Roaring bitmap, WAH ou Concise, ne supportent qu'au plus 4 milliards d'entrees et sont tres souvent impraticables dans de tels contextes. Apres avoir constate ce besoin tant dans le milieu industriel que scientifique, nous proposons trois nouveaux modeles d'index bitmap compresses, bases sur le format de notre precedente contribution Roaring bitmap et qui supportent jusqu'a 2^64 entrees. Des experiences sur des donnees synthetiques ont ete mises en oeuvre pour comparer les perf...

Research paper thumbnail of Collaborative OLAP with Tag Clouds - Web 2.0 OLAP Formalism and Experimental Evaluation

ArXiv, 2008

Increasingly, business projects are ephemeral. New Business Intelligence tools must support ad-li... more Increasingly, business projects are ephemeral. New Business Intelligence tools must support ad-lib data sources and quick perusal. Meanwhile, tag clouds are a popular community-driven visualization technique. Hence, we investigate tag-cloud views with support for OLAP operations such as roll-ups, slices, dices, clustering, and drill-downs. As a case study, we implemented an application where users can upload data and immediately navigate through its ad hoc dimensions. To support social networking, views can be easily shared and embedded in other Web sites. Algorithmically, our tag-cloud views are approximate range top-k queries over spontaneous data cubes. We present experimental evidence that iceberg cuboids provide adequate online approximations. We benchmark several browser-oblivious tag-cloud layout optimizations.

Research paper thumbnail of Optimizing Druid with Roaring bitmaps

Proceedings of the 20th International Database Engineering & Applications Symposium on - IDEAS '16, 2016

Research paper thumbnail of Web 2.0 OLAP: From Data Cubes to Tag Clouds

Lecture Notes in Business Information Processing, 2009

Research paper thumbnail of Conceptual Modeling Using Conceptual Graphs

The next generation of task support systems aims at providing the relevant knowledge to knowledge... more The next generation of task support systems aims at providing the relevant knowledge to knowledge-dependent activities, reducing the effort required to find or infer this knowledge from the data. In order to exploit knowledge associated with (or embedded in) databases and to migrate from data to knowledge management environments, conceptual modeling languages must offer more expressiveness than traditional modeling languages. This paper proposes a well established knowledge representation language, the conceptual graph (CG) formalism, as such a conceptual modeling language. It shows through an example, that it is suited for that purpose, allowing great expressiveness and uniformity of representation, though remaining simple to use. Its graphical interface and closeness to well-established modeling formalisms like UML and the ER model should facilitate its understanding and therefore should ease its integration into the market place. Therefore this paper emphasizes this aspect of the...