KNOWLEDGE AND INFORMATION SYSTEMS知识与信息系统
KNOWLEDGE AND INFORMATION SYSTEMS(英文缩写 KNOWL INF SYST),ISSN 0219-1377,eISSN 0219-3116,中文译名:知识与信息系统 是一本学术期刊。本页汇总该期刊的最新影响因子、分区信息以及最新收录于 PubMed 的文献,帮助您快速了解期刊全貌。
发文量统计区间：2025-11-01 至 2026-10-31，按本站收录文献的发表日期统计。
期刊介绍
历年影响因子趋势
| JCR 数据年份 | 影响因子 | JCR 分区 |
|---|---|---|
| 2021 | 2.531 | Q3 |
| 2022 | 2.700 | Q3 |
| 2023 | 2.500 | Q2 |
| 2024 | 3.100 | Q2 |
| 2025 | 3.600 | Q2 |
KNOWLEDGE AND INFORMATION SYSTEMS 最新收录文献
-
1. General OOD detection via model-aware and subspace-aware variable priority.
1. 通过模型感知和子空间感知变量优先级的通用OOD检测PMID:日期:2026-08-28Out-of-distribution (OOD) detection flags test inputs that depart from the data used to train a model. For structured tabular problems with regression or survival outcomes, existing methods remain limited because many OOD detectors are designed for classification or unstructured data. We introduce a tree based method that uses the rule structure of a supervised forest to determine the predictive subspace, the model-aware reference neighborhood, and the final OOD score in a single construction. The score compares each test input with forest selected reference cases only on prediction relevant variables, reducing signal dilution from nuisance coordinates. Across synthetic and real data benchmarks, the method performs especially well for subtle targeted feature shifts and changes in dependence. An esophageal cancer survival study further shows how OOD scores can reveal lymphadenectomy related shifts relevant to surgical guidelines.
-
2. Automated biomedical hypothesis generation with time-aware hypergraph contrastive learning.
PMID:日期:2026-05-17Research in scientific domains now generates more than a million articles annually, overwhelming researchers and hindering discovery. This surge has sparked interest in biomedical hypothesis generation (HG), which aims to uncover implicit patterns among biomedical concepts. Most existing methods focus on pairwise link prediction, overlooking the complex, multi-concept relationships underlying many breakthroughs. We introduce , a temporal pergraph contrastive learning framework for biomedical ypothesis eneration, which redefines hypotheses as hyperedges-sets of co-mentioned concepts in an article. By representing articles as hyperedges and organizing them into a temporal hypergraph, HyHG captures the evolution of scientific ideas over time. A transformer-based architecture learns from historical hyperedge sequences to predict future hyperedges-sets of concepts likely to co-occur in the future literature. To distinguish genuine hypotheses from misleading ones, HyHG employs a time-anchored contrastive loss and hard negative sampling based on minimal edits to real hyperedges. We demonstrate that HyHG achieves state-of-the-art performance on three biomedical datasets. Our code and data are available at: https://github.com/amir-hassan25/Temporal-Hypergraph-Contrastive-Learning.
-
3. Restless reachability problems in temporal graphs.
PMID:日期:2025-04-01We study a family of reachability problems under waiting-time restrictions in temporal and vertex-colored temporal graphs. Given a temporal graph and a set of source vertices, we find the set of vertices that are reachable from a source via a time-respecting path, where the difference in timestamps between consecutive edges is at most a resting time. Given a vertex-colored temporal graph and a multiset query of colors, we find the set of vertices reachable from a source via a time-respecting path such that the vertex colors of the path agree with the multiset query and the difference in timestamps between consecutive edges is at most a resting time. These kinds of problems have applications in understanding the spread of a disease in a network, tracing contacts in epidemic outbreaks, finding signaling pathways in the brain network, and recommending tours for tourists, among others. We present an algebraic algorithmic framework based on constrained multilinear sieving for solving the restless reachability problems we propose. In particular, parameterized by the length of a path sought, we show that the proposed problems can be solved in time and space, where is the number of vertices, the number of edges, and the maximum resting time of an input temporal graph. The approach can be extended to extract paths and connected subgraphs in both static and temporal graphs, thus improving the work of Björklund et al. (in Proceedings of the European symposium on algorithms, 2014) and Thejaswi et al. (Big Data 8:335-362, 2020). In addition, we prove that our algorithms for the restless reachability problems in vertex-colored temporal graphs are optimal under plausible complexity-theoretic assumptions. Finally, with an open-source implementation, we demonstrate that our algorithm scales to large graphs with up to one billion temporal edges, despite the problems being NP-hard. Specifically, we present extensive experiments to evaluate our scalability claims both on synthetic and on real-world graphs. Our implementation is efficiently engineered and highly optimized. For instance, we can solve the restless reachability problem by restricting the path length to 9 in a real-world graph dataset with over 36 million directed edges in less than one hour on a commodity desktop with a 4-core Haswell CPU.
-
4. A survey on rumor detection and prevention in social media using deep learning.
PMID:日期:2023-05-29In the current digital era, massive amounts of unreliable, purposefully misleading material, such as texts and images, are being shared widely on various web platforms to deceive the reader. Most of us use social media sites to exchange or obtain information. This opens a lot of space for false information, like fake news, rumors, etc., to spread that could harm a society's social fabric, a person's reputation, or the legitimacy of a whole country. Therefore, preventing the transmission of such dangerous material across platforms is a digital priority. However, the main goal of this survey paper is to thoroughly examine several current state-of-the-art research works on rumor control (detection and prevention) that use deep learning-based techniques and to identify major distinctions between these research efforts. The comparison results are intended to identify research gaps and challenges for rumor detection, tracking, and combating. This survey of the literature makes a significant contribution by highlighting several cutting-edge deep learning-based models for rumor detection in social media and critically evaluating their effectiveness on recently available standard datasets. Furthermore, to have a thorough grasp of rumor prevention to spread, we also looked into various pertinent approaches, including rumor veracity classification, stance classification, tracking, and combating. We also have created a summary of recent datasets with all the necessary information and analysis. Finally, as part of this survey, we have identified some of the potential research gaps and challenges that need to be addressed in order to develop early, effective methods of rumor control.
-
5. Computer-aided diagnosis systems: a comparative study of classical machine learning versus deep learning-based approaches.
PMID:日期:2023-05-24The diagnostic phase of the treatment process is essential for patient guidance and follow-up. The accuracy and effectiveness of this phase can determine the life or death of a patient. For the same symptoms, different doctors may come up with different diagnoses whose treatments may, instead of curing a patient, be fatal. Machine learning (ML) brings new solutions to healthcare professionals to save time and optimize the appropriate diagnosis. ML is a data analysis method that automates the creation of analytical models and promotes predictive data. There are several ML models and algorithms that rely on features extracted from, for example, a patient's medical images to indicate whether a tumor is benign or malignant. The models differ in the way they operate and the method used to extract the discriminative features of the tumor. In this article, we review different ML models for tumor classification and COVID-19 infection to evaluate the different works. The computer-aided diagnosis (CAD) systems, which we referred to as classical, are based on accurate feature identification, usually performed manually or with other ML techniques that are not involved in classification. The deep learning-based CAD systems automatically perform the identification and extraction of discriminative features. The results show that the two types of DAC have quite close performances but the use of one or the other type depends on the datasets. Indeed, manual feature extraction is necessary when the size of the dataset is small; otherwise, deep learning is used.
-
6. {"_":": a framework for automatic short answers grading in educational contexts-design, implementation and evaluation.","i":["GradeAid"]}
PMID:日期:2023-05-19Automatic short answer grading (ASAG), a hot field of natural language understanding, is a research area within learning analytics. ASAG solutions are conceived to offload teachers and instructors, especially those in higher education, where classes with hundreds of students are the norm and the task of grading (short)answers to open-ended questionnaires becomes tougher. Their outcomes are precious both for the very grading and for providing students with "" feedback. ASAG proposals have also enabled different intelligent tutoring systems. Over the years, a variety of ASAG solutions have been proposed, still there are a series of gaps in the literature that we fill in this paper. The present work proposes , a framework for ASAG. It is based on the joint analysis of lexical and semantic features of the students' answers through state-of-the-art regressors; differently from any other previous work, it copes with non-English datasets, it has undergone a robust validation and benchmarking phase, and it has been tested on every dataset publicly available and on a new dataset (now available for researchers). obtains performance comparable to the systems presented in the literature (root-mean-squared errors down to 0.25 based on the specific tuple dataset-question). We argue it represents a strong baseline for further developments in the field.
-
7. Tracking social provenance in chains of retweets.
PMID:日期:2023-05-09In the era of massive sharing of information, the term social provenance is used to denote the ownership, source or origin of a piece of information which has been propagated through social media. Tracking the provenance of information is becoming increasingly important as social platforms acquire more relevance as source of news. In this scenario, Twitter is considered one of the most important social networks for information sharing and dissemination which can be accelerated through the use of retweets and quotes. However, the Twitter API does not provide a complete tracking of the retweet chains, since only the connection between a retweet and the original post is stored, while all the intermediate connections are lost. This can limit the ability to track the diffusion of information as well as the estimation of the importance of specific users, who can rapidly become influencers, in the news dissemination. This paper proposes an innovative approach for rebuilding the possible chains of retweets and also providing an estimation of the contributions given by each user in the information spread. For this purpose, we define the concept of Provenance Constraint Network and a modified version of the Path Consistency Algorithm. An application of the proposed technique to a real-world dataset is presented at the end of the paper.
-
8. Entity graphs for exploring online discourse.
PMID:日期:2023-04-24A vast amount of human communication occurs online. These digital traces of natural human communication along with recent advances in natural language processing technology provide for computational analysis of these discussions. In the study of social networks, the typical perspective is to view users as nodes and concepts as flowing through and among the user nodes within the social network. In the present work, we take the opposite perspective: we extract and organize massive amounts of group discussion into a concept space we call an where concepts and entities are static and human communicators move about the concept space via their conversations. Framed by this perspective, we performed several experiments and comparative analysis on large volumes of online discourse from Reddit. In quantitative experiments, we found that discourse was difficult to predict, especially as the conversation carried on. We also developed an interactive tool to visually inspect over the entity graph; although they were difficult to predict, we found that conversations, in general, tended to diverge to a vast swath of topics initially, but then tended to converge to simple and popular concepts as the conversation progressed. An application of the spreading activation function from the field of cognitive psychology also provided compelling visual narratives from the data.
-
9. Motif-guided Heterogeneous Graph Deep Generation.
PMID:日期:2023-03-31The complex systems in the real-world are commonly associated with multiple types of objects and relations, and heterogeneous graphs are ubiquitous data structures that can inherently represent multi-modal interactions between objects. Generating high-quality heterogeneous graphs allows us to understand the implicit distribution of heterogeneous graphs and provides benchmarks for downstream heterogeneous representation learning tasks. Existing works are limited to either merely generating the graph topology with neglecting local semantic information or only generating the graph without preserving the higher-order structural information and the global heterogeneous distribution in generated graphs. To this end, we formulate a general, end-to-end framework - HGEN for generating novel heterogeneous graphs with a newly proposed heterogeneous walk generator. On top of HGEN, we further develop a network motif generator to better characterize the higher-order structural distribution. A novel heterogeneous graph assembler is further developed to adaptively assemble novel heterogeneous graphs from the generated heterogeneous walks and motifs in a stratified manner. The extended model is proven to preserve the local semantic and heterogeneous global distribution of observed graphs with the theoretical guarantee. Lastly, comprehensive experiments on both synthetic and real-world practical datasets demonstrate the power and efficiency of the proposed method.
-
10. Harnessing heterogeneity in space with statistically guided meta-learning.
PMID:日期:2023-03-08Spatial data are ubiquitous, massively collected, and widely used to support critical decision-making in many societal domains, including public health (e.g., COVID-19 pandemic control), agricultural crop monitoring, transportation, etc. While recent advances in machine learning and deep learning offer new promising ways to mine such rich datasets (e.g., satellite imagery, COVID statistics), spatial heterogeneity-an intrinsic characteristic embedded in spatial data-poses a major challenge as data distributions or generative processes often vary across space at different scales, with their spatial extents unknown. Recent studies (e.g., SVANN, spatial ensemble) targeting this difficult problem either require a known space-partitioning as the input, or can only support very limited number of partitions or classes (e.g., two) due to the decrease in training data size and the complexity of analysis. To address these limitations, we propose a model-agnostic framework to automatically transform a deep learning model into a spatial-heterogeneity-aware architecture, where the learning of arbitrary space partitionings is guided by a learning-engaged generalization of multivariate scan statistic and parameters are shared based on spatial relationships. Moreover, we propose a spatial moderator to generalize learned space partitionings to new test regions. Finally, we extend the framework by integrating meta-learning-based training strategies into both spatial transformation and moderation to enhance knowledge sharing and adaptation among different processes. Experiment results on real-world datasets show that the framework can effectively capture flexibly shaped heterogeneous footprints and substantially improve prediction performances.