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

Pascal Soucy

dblp:43/5574 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2005
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-author

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.

Artificial intelligence
2 papers
Information extraction and text analysis · 50% Representation and self-supervised learning · 50%
Databases, data mining, and information retrieval
1 paper
Data mining · 75% Recommender systems · 25%

Topics — the 7 heaviest of 8, 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
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

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

TFIDF weighting · 0.1kNN · 0.0feature selection · 0.0feature interaction · 0.0
YearPublicationVenuePosition
2005 Beyond TFIDF Weighting for Text Categorization in the Vector Space Model
Pascal Soucy, Guy W. Mineau
IJCAI1
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
ICDM1
2001 A Simple Feature Selection Method for Text Classification
Pascal Soucy, Guy W. Mineau
IJCAI1