Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Guy W. Mineau

dblp:32/2562 · DBLP profile ↗
← Back
12ranked-venue papers
5as first author
0since 2021 · last 2007
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 9 · 3 first-authorDatabases, data management, data science and information retrieval · 6 · 4 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3Software engineering, systems software and programming languages · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
4 papers
Data mining · 84% Recommender systems · 14% Machine learning and data management · 3%
Artificial intelligence
4 papers
Information extraction and text analysis · 41% Representation and self-supervised learning · 41% Knowledge representation and reasoning · 18%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 15 heaviest of 17, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis
text classification
0.122005
Beyond TFIDF Weighting for Text Categorization in the Vector Space Model · IJCAI 2005
A Simple Feature Selection Method for Text Classification · IJCAI 2001
Data mining › predictive modeling › classification
ensemble learning
0.112007
Distributed Data Mining: Why Do More Than Aggregating Models · IJCAI 2007
Distributed systems › distributed data processing
distributed data mining
0.112007
Distributed Data Mining: Why Do More Than Aggregating Models · IJCAI 2007
Machine learning › Representation and self-supervised learning › word representation
vector space models
0.112005
Beyond TFIDF Weighting for Text Categorization in the Vector Space Model · IJCAI 2005
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction
feature selection
0.012001
A Simple Feature Selection Method for Text Classification · IJCAI 2001
Recommender systems › click-through rate prediction
feature interaction
0.012001
A Simple KNN Algorithm for Text Categorization · ICDM 2001
Data mining › dimensionality reduction
feature selection
0.012001
A Simple KNN Algorithm for Text Categorization · ICDM 2001
Data mining › predictive modeling › classification › instance-based learning
k-nearest neighbor
0.012001
A Simple KNN Algorithm for Text Categorization · ICDM 2001
Data mining › text mining
text classification
0.012001
A Simple KNN Algorithm for Text Categorization · ICDM 2001
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge base
knowledge base management
0.011995
Automatic Structuring of Knowledge Bases by Conceptual Clustering · IEEE Trans. Knowl. Data Eng. 1995
Knowledge, reasoning and agents › Knowledge representation and reasoning
ontology
0.011995
Automatic Structuring of Knowledge Bases by Conceptual Clustering · IEEE Trans. Knowl. Data Eng. 1995
Data mining
clustering
0.011995
Automatic Structuring of Knowledge Bases by Conceptual Clustering · IEEE Trans. Knowl. Data Eng. 1995
Data mining › clustering
conceptual clustering
0.011995
Automatic Structuring of Knowledge Bases by Conceptual Clustering · IEEE Trans. Knowl. Data Eng. 1995
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge acquisition
knowledge base construction
0.011990
Structuring Knowledge Bases Using Automatic Learning · ICDE 1990
Knowledge, reasoning and agents › Knowledge representation and reasoning › ontology › concept hierarchy
inheritance hierarchies
0.011995
Automatic Structuring of Knowledge Bases by Conceptual Clustering · IEEE Trans. Knowl. Data Eng. 1995

Methods — techniques the papers use, named apart from their topics

TFIDF weighting · 0.1kNN · 0.0feature selection · 0.0feature interaction · 0.0conceptual clustering · 0.0machine learning · 0.0generalization inference · 0.0
YearPublicationVenuePosition
2007 Distributed Data Mining: Why Do More Than Aggregating Models
Mohamed Aounallah, Guy W. Mineau
IJCAI2
2006 SeseiOnto: Interfacing NLP and Ontology Extraction
abstract
For many years, information retrieval tools have been used to try to solve the information overload problem which was accentuated by the coming of age of the World Wide Web. Some tools used Boolean search, others, natural language based processing (NLP). Ontology-based techniques were proposed to improve the quality of the search but none were widely adopted since they did not statistically enhance either the recall or the precision of the search. However, when it comes to information extraction, they may be of significant help. Their integration in professional search engines has been rather slow, partially due to the fact that the ontology building process is time consuming. In this paper, we describe the SeseiOnto software, which uses simple artificial intelligence techniques to improve information extraction and retrieval. To assist the NLP-based information retrieval on a corpus of documents, SeseiOnto employs an automatically generated ontology. Under our experiments, we found that SeseiOnto obtained results comparable to a traditional search engine, while providing a natural language interface to its user
Maxime Morneau, Guy W. Mineau, Dan Corbett
Web Intelligence2
2005 Beyond TFIDF Weighting for Text Categorization in the Vector Space Model
Pascal Soucy, Guy W. Mineau
IJCAI2
2001 A Simple KNN Algorithm for Text Categorization
abstract
Text categorization (also called text classification) is the process of identifying the class to which a text document belongs. This paper proposes to use a simple non-weighted features KNN algorithm for text categorization. We propose to use a feature selection method that finds the relevant features for the learning task at hand using feature interaction (based on word interdependencies). This will allow us to reduce considerably the number Of selected features from which to learn, making our KNN algorithm applicable in contexts where both the volume of documents and the size of the vocabulary are high, like with the World Wide Web. Therefore, the KNN algorithm that we propose becomes efficient for classifying text documents in that context (in terms of its predictability and interpretability), as is demonstrated. Its simplicity (WRT its implementation and fine-tuning) becomes its main assets for in-the-field applications.
Pascal Soucy, Guy W. Mineau
ICDM2
2001 A Simple Feature Selection Method for Text Classification
Pascal Soucy, Guy W. Mineau
IJCAI2
2000 Conceptual modeling for data and knowledge management
Guy W. Mineau, Rokia Missaoui, Robert Godin
Data Knowl. Eng.1
1999 Knowledge Retrieval, Use and Storage for Efficiency
abstract
The Knowledge Retrieval, Use and Storage for Efficiency (KRUSE) symposiums aim at providing a forum for research related to efficient processing and management of complex information and knowledge. This special issue presents selected articles from the KURSE'97 symposium held in Vancouver, Canada. In this introductory article we describe the goals of KRUSE and present some background topics that are fundamental to the articles herein. In particular, we provide an overview of partial order theory, formal concept analysis and taxonomic encoding. We also outline the articles that follow.
Andrew Fall, Guy W. Mineau
Comput. Intell.2
1995 Applying Concept Formation Methods to Software Reuse
abstract
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.
Robert Godin, Guy W. Mineau, Rokia Missaoui, Marc St-Germain, Najib Faraj
Int. J. Softw. Eng. Knowl. Eng.2
1995 Automatic Structuring of Knowledge Bases by Conceptual Clustering
abstract
An important structuring mechanism for knowledge bases is building an inheritance hierarchy of classes based on the content of their knowledge objects. This hierarchy facilitates group-related processing tasks such as answering set queries, discriminating between objects, finding similarities among objects, etc. Building this hierarchy is a difficult task for the knowledge engineer. Conceptual clustering may be used to automate or assist the engineer in the creation of such a classification structure. This article introduces a new conceptual clustering method which addresses the problem of clustering large amounts of structured objects. The conditions under which the method is applicable are discussed.>
Guy W. Mineau, Robert Godin
IEEE Trans. Knowl. Data Eng.1
1993 Facilitating the Creation of a Multiple Index on Graph-Described Documents by Transforming Their Descriptions
Guy W. Mineau
CIKM1
1992 Towards compatible primitive structures
abstract
This paper addresses the problem of knowledge interchange between two knowledge-based systems whose knowledge is represented using the conceptual graph formalism of Sowa (1984). For this work it is assumed that there are protocols allowing these systems to communicate, consequently a channel between the systems can be established and graphs can be exchanged. This paper concentrates on the translation of graphs from one system's semantics to the other's. Without such translation, the exchanged graphs would remain useless. The method this paper proposes aims at relating different syntactical structures by detecting their co-occurrence in semantically similar contexts. Because we need to identify such contexts, the method requires the intervention of knowledge engineers of both systems
Guy W. Mineau
J. Exp. Theor. Artif. Intell.1
1990 Structuring Knowledge Bases Using Automatic Learning
abstract
The need to add an automatic learning phase to the construction process of a knowledge base is stressed. This work introduces a new technique based on machine learning methodologies which automatically creates a particular knowledge representation structure called knowledge space, from which common generalizations of knowledge objects may be efficiently inferred. Also introduced are some of the improved and added processing capabilities made possible by this structure.>
Guy W. Mineau, Jan Gecsei, Robert Godin
ICDE1