University of Houston at CL-SciSumm 2016: SVMs with tree kernels and Sentence Similarity
Code (0)
등록된 구현이 없습니다.
Tasks
Information RetrievalSentenceSentence SimilarityText SummarizationSimilar Papers 제목 키워드 기반
Universal Kernels on Non-Standard Input Spaces
During the last years support vector machines (SVMs) have been successfully applied even in situations where the input space $X$ is not necessarily a subset of $R^d$. Examples include SVMs using probability measures to a…
text-classificationText ClassificationUniHD@CL-SciSumm 2020: Citation Extraction as Search
This work presents the entry by the team from Heidelberg University in the CL-SciSumm 2020 shared task at the Scholarly Document Processing workshop at EMNLP 2020. As in its previous iterations, the task is to highlight …
Re-RankingRanking Kernels for Structures and Embeddings: A Hybrid Preference and Classification Model
Recent work has shown that Tree Kernels (TKs) and Convolutional Neural Networks (CNNs) obtain the state of the art in answer sentence reranking. Additionally, their combination used in Support Vector Machines (SVMs) is p…
Community Question AnsweringGeneral ClassificationLearning-To-RankQuestion Answering+3Node Splitting SVMs for Survival Trees Based on an L2-Regularized Dipole Splitting Criteria
This paper proposes a novel, node-splitting support vector machine (SVM) for creating survival trees. This approach is capable of non-linearly partitioning survival data which includes continuous, right-censored outcomes…
Adaptive Band Selection for Hyperspectral Classification with Spatially Disjoint Evaluation
Hyperspectral band selection methods based on differentiable selectors can be sensitive to initialization and to extracting a final discrete subset, while prescribed band counts limit flexibility. We propose SGBR-HC (Spe…