Corpus ID: 14588149

Discovering Better AAAI Keywords via Clustering with Community-Sourced Constraints

  title={Discovering Better AAAI Keywords via Clustering with Community-Sourced Constraints},
  author={Kelly Moran and Byron C. Wallace and Carla E. Brodley},
Selecting good conference keywords is important because they often determine the composition of review committees and hence which papers are reviewed by whom. But presently conference keywords are generated in an ad-hoc manner by a small set of conference organizers. This approach is plainly not ideal. There is no guarantee, for example, that the generated keyword set aligns with what the community is actually working on and submitting to the conference in a given year. This is especially true… Expand
Automatic Scientific Document Clustering Using Self-organized Multi-objective Differential Evolution
The effectiveness of the proposed approach, namely self-organizing map based multi-objective document clustering technique (SMODoc_clust) is shown in automatic classification of some scientific articles and web-documents. Expand
Max-Entropy Feed-Forward Clustering Neural Network
The results illustrate that the Entropy-Based Principle method outperforms all the other baselines that are most popular clustering methods. Expand
Plurality: The End of Singularity?
The new possibilities of the so-called AI Renaissance and the opportunities provided by the techniques collected under the name of deep learning are considered in order to suggest a “pluralistic” view on singularity. Expand
AI Paradigms and AI Safety: Mapping Artefacts and Techniques to Safety Issues
A need for AI safety to be more explicit about the artefacts and techniques for which a particular issue may be applicable, in order to identify gaps and cover a broader range of issues is identified. Expand


Unsupervised graph-based topic labelling using dbpedia
Automated topic labelling brings benefits for users aiming at analysing and understanding document collections, as well as for search engines targetting at the linkage between groups of words andExpand
Finding the Number of Clusters in a Dataset
One of the most difficult problems in cluster analysis is identifying the number of groups in a dataset. Most previously suggested approaches to this problem are either somewhat ad hoc or requireExpand
Automatic labeling of multinomial topic models
Probabilistic approaches to automatically labeling multinomial topic models in an objective way are proposed and can be applied to labeling topics learned through all kinds of topic models such as PLSA, LDA, and their variations. Expand
Impact of Similarity Measures on Web-page Clustering
Clustering of web documents enables (semi-)automated categorization, and facilitates certain types of search. Any clustering method has to embed the documents in a suitable similarity space. WhileExpand
Redefining class definitions using constraint-based clustering: an application to remote sensing of the earth's surface
The method, Class-Level PPC (CPPC) extends PPC showing how its time complexity can be reduced from O(N2) to O(NL) for the problem of class re-definition and extends the algorithm by presenting a heuristic to measure adherence to constraints, and providing a criterion for determining the model complexity (number of classes) for constraint-based clustering. Expand
An examination of procedures for determining the number of clusters in a data set
A Monte Carlo evaluation of 30 procedures for determining the number of clusters was conducted on artificial data sets which contained either 2, 3, 4, or 5 distinct nonoverlapping clusters. ToExpand
Hierarchical Dirichlet Processes
We consider problems involving groups of data where each observation within a group is a draw from a mixture model and where it is desirable to share mixture components between groups. We assume thatExpand
The use of bigrams to enhance text categorization
An efficient text categorization algorithm that generates bigrams selectively by looking for ones that have an especially good chance of being useful by using the information gain metric, combined with various frequency thresholds is presented. Expand
Automatic Labelling of Topic Models
This work proposes a method for automatically labelling topics learned via LDA topic models using a combination of association measures and lexical features, optionally fed into a supervised ranking model. Expand
Kernel k-means: spectral clustering and normalized cuts
The generality of the weighted kernel k-means objective function is shown, and the spectral clustering objective of normalized cut is derived as a special case, leading to a novel weightedkernel k-Means algorithm that monotonically decreases the normalized cut. Expand