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

Sajib Dasgupta

dblp:33/2479 · DBLP profile ↗
← Back
10ranked-venue papers
8as first author
0since 2021 · last 2012
—ORCID · none

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

Artificial intelligence and machine learning · 8 · 7 first-authorDatabases, data management, data science and information retrieval · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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
5 papers
Information extraction and text analysis · 92% Language models and text generation · 8%
Databases, data mining, and information retrieval
3 papers
Data mining · 100%

Topics — the 12 heaviest of 13, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining
clustering
0.322012
Clustering Documents Along Multiple Dimensions · AAAI 2012
Mining Clustering Dimensions · ICML 2010
Natural language and speech › Information extraction and text analysis
sentiment analysis
0.332009
Topic-wise, Sentiment-wise, or Otherwise? Identifying the Hidden Dimension for Unsupervised Text Classification · EMNLP 2009
Mine the Easy, Classify the Hard: A Semi-Supervised Approach to Automatic Sentiment Classification · ACL/IJCNLP 2009
Examining the Role of Linguistic Knowledge Sources in the Automatic Identification and Classification of Reviews · ACL 2006
Data mining › clustering
document clustering
0.222012
Towards subjectifying text clustering · SIGIR 2010
Clustering Documents Along Multiple Dimensions · AAAI 2012
Data mining › clustering
alternative clustering
0.112012
Clustering Documents Along Multiple Dimensions · AAAI 2012
Natural language and speech › Information extraction and text analysis
rule-based information extraction
0.112011
The SystemT IDE: an integrated development environment for information extraction rules · SIGMOD Conference 2011
Natural language and speech › Information extraction and text analysis › sentiment analysis › sentiment classification
semi-supervised sentiment classification
0.112009
Mine the Easy, Classify the Hard: A Semi-Supervised Approach to Automatic Sentiment Classification · ACL/IJCNLP 2009
Natural language and speech › Information extraction and text analysis
text classification
0.112009
Topic-wise, Sentiment-wise, or Otherwise? Identifying the Hidden Dimension for Unsupervised Text Classification · EMNLP 2009
Natural language and speech › Information extraction and text analysis › text classification
unsupervised text classification
0.112009
Topic-wise, Sentiment-wise, or Otherwise? Identifying the Hidden Dimension for Unsupervised Text Classification · EMNLP 2009
Natural language and speech › Language models and text generation
low-resource language processing
0.112007
Unsupervised Part-of-Speech Acquisition for Resource-Scarce Languages · EMNLP-CoNLL 2007
Natural language and speech › Information extraction and text analysis › sequence labeling › part-of-speech tagging
part-of-speech induction
0.112007
Unsupervised Part-of-Speech Acquisition for Resource-Scarce Languages · EMNLP-CoNLL 2007
Natural language and speech › Information extraction and text analysis › sequence labeling
part-of-speech tagging
0.112007
Unsupervised Part-of-Speech Acquisition for Resource-Scarce Languages · EMNLP-CoNLL 2007
Data mining › text mining
text classification
0.012010
Towards subjectifying text clustering · SIGIR 2010

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

unsupervised learning · 0.2probabilistic model · 0.1rule-based extraction · 0.1user feedback · 0.1active clustering · 0.1semi-supervised learning · 0.1linguistic knowledge sources · 0.1
YearPublicationVenuePosition
2012 Clustering Documents Along Multiple Dimensions
abstract
Traditional clustering algorithms are designed to search for a single clustering solution despite the fact that multiple alternative solutions might exist for a particular dataset. For example, a set of news articles might be clustered by topic or by the author's gender or age. Similarly, book reviews might be clustered by sentiment or comprehensiveness. In this paper, we address the problem of identifying alternative clustering solutions by developing a Probabilistic Multi-Clustering (PMC) model that discovers multiple, maximally different clusterings of a data sample. Empirical results on six datasets representative of real-world applications show that our PMC model exhibits superior performance to comparable multi-clustering algorithms.
Sajib Dasgupta, Richard M. Golden, Vincent Ng 0001
AAAI1
2011 The SystemT IDE: an integrated development environment for information extraction rules
abstract
Information Extraction (IE)-the problem of extracting structured information from unstructured text - has become the key enabler for many enterprise applications such as semantic search, business analytics and regulatory compliance. While rule-based IE systems are widely used in practice due to their well-known "explainability," developing high-quality information extraction rules is known to be a labor-intensive and time-consuming iterative process.
Laura Chiticariu, Vivian Chu, Sajib Dasgupta, Thilo W. Goetz, C. T. Howard Ho, Rajasekar Krishnamurthy, Alexander Lang, Yunyao Li 0001, Bin Liu 0002, Sriram Raghavan, Frederick Reiss 0001, Shivakumar Vaithyanathan, Huaiyu Zhu 0001
SIGMOD Conference3
2010 Mining Clustering Dimensions
Sajib Dasgupta, Vincent Ng 0001
ICML1
2010 Towards subjectifying text clustering
abstract
Although it is common practice to produce only a single clustering of a dataset, in many cases text documents can be clustered along different dimensions. Unfortunately, not only do traditional text clustering algorithms fail to produce multiple clusterings of a dataset, the only clustering they produce may not be the one that the user desires. In this paper, we propose a simple active clustering algorithm that is capable of producing multiple clusterings of the same data according to user interest. In comparison to previous work on feedback-oriented clustering, the amount of user feedback required by our algorithm is minimal. In fact, the feedback turns out to be as simple as a cursory look at a list of words. Experimental results are very promising: our system is able to generate clusterings along the user-specified dimensions with reasonable accuracies on several challenging text classification tasks, thus providing suggestive evidence that our approach is viable.
Sajib Dasgupta, Vincent Ng 0001
SIGIR1
2010 Which Clustering Do You Want? Inducing Your Ideal Clustering with Minimal Feedback
abstract
While traditional research on text clustering has largely focused on grouping documents by topic, it is conceivable that a user may want to cluster documents along other dimensions, such as the author's mood, gender, age, or sentiment. Without knowing the user's intention, a clustering algorithm will only group documents along the most prominent dimension, which may not be the one the user desires. To address the problem of clustering documents along the user-desired dimension, previous work has focused on learning a similarity metric from data manually annotated with the user's intention or having a human construct a feature space in an interactive manner during the clustering process. With the goal of reducing reliance on human knowledge for fine-tuning the similarity function or selecting the relevant features required by these approaches, we propose a novel active clustering algorithm, which allows a user to easily select the dimension along which she wants to cluster the documents by inspecting only a small number of words. We demonstrate the viability of our algorithm on a variety of commonly-used sentiment datasets.
Sajib Dasgupta, Vincent Ng 0001
J. Artif. Intell. Res.1
2009 Mine the Easy, Classify the Hard: A Semi-Supervised Approach to Automatic Sentiment Classification
Sajib Dasgupta, Vincent Ng 0001
ACL/IJCNLP1
2009 Topic-wise, Sentiment-wise, or Otherwise? Identifying the Hidden Dimension for Unsupervised Text Classification
Sajib Dasgupta, Vincent Ng 0001
EMNLP1
2007 Unsupervised Part-of-Speech Acquisition for Resource-Scarce Languages
Sajib Dasgupta, Vincent Ng 0001
EMNLP-CoNLL1
2007 High-Performance, Language-Independent Morphological Segmentation
Sajib Dasgupta, Vincent Ng 0001
HLT-NAACL1
2006 Examining the Role of Linguistic Knowledge Sources in the Automatic Identification and Classification of Reviews
Vincent Ng 0001, Sajib Dasgupta, S. M. Niaz Arifin
ACL2