检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

42 篇 会议
15 篇 期刊文献
4 册 图书

馆藏范围

61 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

31 篇 工学
- 29 篇 计算机科学与技术...
- 18 篇 软件工程
- 10 篇 信息与通信工程
- 4 篇 材料科学与工程（可...
- 4 篇 控制科学与工程
- 3 篇 电气工程
- 2 篇 化学工程与技术
- 2 篇 生物工程
- 1 篇 农业工程
- 1 篇 生物医学工程（可授...
14 篇 理学
- 9 篇 数学
- 2 篇 物理学
- 2 篇 化学
- 2 篇 生物学
- 1 篇 系统科学
- 1 篇 统计学（可授理学、...
8 篇 管理学
- 5 篇 图书情报与档案管...
- 3 篇 管理科学与工程(可...
- 2 篇 工商管理
2 篇 医学
- 2 篇 临床医学
- 1 篇 基础医学(可授医学...
- 1 篇 药学(可授医学、理...
1 篇 农学
- 1 篇 作物学

主题

14 篇 knowledge engine...
9 篇 clustering algor...
8 篇 fuzzy sets
8 篇 artificial intel...
7 篇 prototypes
7 篇 data analysis
6 篇 computer science
4 篇 data engineering
4 篇 design engineeri...
4 篇 partitioning alg...
3 篇 information syst...
3 篇 neural networks
3 篇 terminology
3 篇 data mining
3 篇 database managem...
3 篇 covariance matri...
3 篇 computational mo...
3 篇 costs
3 篇 humans
3 篇 bayesian methods

机构

9 篇 department of kn...
4 篇 mainlp center fo...
4 篇 otto von guerick...
4 篇 department of co...
4 篇 faculty of compu...
4 篇 fraunhofer cente...
4 篇 ubiquitous knowl...
3 篇 department of kn...
3 篇 european centre ...
3 篇 fachbereich math...
2 篇 department of kn...
2 篇 fakultät für ele...
2 篇 department of kn...
2 篇 dipartimento di ...
2 篇 department of kn...
2 篇 department natur...
2 篇 apptek gmbh
2 篇 trustworthy huma...
2 篇 department of kn...
2 篇 cognitive comput...

作者

13 篇 r. kruse
10 篇 c. borgelt
9 篇 kruse rudolf
9 篇 rudolf kruse
7 篇 borgelt christia...
6 篇 gurevych iryna
4 篇 h. timm
4 篇 plank barbara
4 篇 zesch torsten
4 篇 senger elena
4 篇 van der goot rob
3 篇 c. doring
3 篇 christian borgel...
3 篇 xiaomeng wang
2 篇 a. nurnberger
2 篇 pasi gabriella
2 篇 frank hoffmann
2 篇 eyke hüllermeier
2 篇 habernal ivan
2 篇 levy omer

语言

60 篇 英文
1 篇 其他

检索条件"机构=Department of Knowledge and Language Processing"

共 61 条记录，以下是1-10 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

KARRIEREWEGE: A Large Scale Career Path Prediction Dataset 31

KARRIEREWEGE: A Large Scale Career Path Prediction Dataset

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Senger, Elena Campbell, Yuri van der Goot, Rob Plank, Barbara MaiNLP Center for Information and Language Processing LMU Munich Germany Fraunhofer Center for International Management and Knowledge Economy IMW Germany Department of Computer Science IT University of Copenhagen Denmark

ISBN: (纸本)9798891761971

Accurate career path prediction can support many stakeholders, like job seekers, recruiters, HR, and project managers. However, publicly available data and tools for career path prediction are scarce. In this work, we introduce KARRIEREWEGE, a comprehensive, publicly available dataset containing over 500k career paths, significantly surpassing the size of previously available datasets. We link the dataset to the ESCO taxonomy to offer a valuable resource for predicting career trajectories. To tackle the problem of free-text inputs typically found in resumes, we enhance it by synthesizing job titles and descriptions resulting in KARRIEREWEGE+. This allows for accurate predictions from unstructured data, closely aligning with real-world application challenges. We benchmark existing state-of-the-art (SOTA) models on our dataset and a prior benchmark and observe improved performance and robustness, particularly for free-text use cases, due to the synthesized data. ©2025 Association for Computational Linguistics.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Mining significant frequent patterns in parallel episodes with a graded notion of synchrony and selective participation 7

Mining significant frequent patterns in parallel episodes wi...

引用

7th International Joint Conference on Computational Intelligence, IJCCI 2015

作者： Ezennaya-Gomez, Salatiel Borgelt, Christian 33600 Spain Department of Knowledge and Language Processing Otto-von-Guericke University Magdeburg Germany

ISBN: (纸本)9789897581571

We consider the task of finding frequent parallel episodes in parallel point processes (or event sequences), allowing for imprecise synchrony of the events constituting occurrences (temporal imprecision) as well as incomplete occurrences (selective participation). The temporal imprecision problem is tackled by frequent pattern mining using a graded notion of synchrony that captures both the number of instances of a pattern as well as the precision of synchrony of its events. To cope with selective participation, a reduction sequence of items (or event types) is formed based on found frequent patterns and guided by pattern overlap. We evaluate the performance of this method on a large number of data sets with injected parallel episodes. We demonstrate that, in contrast to binary synchrony where it pays to consider the pattern instances, graded synchrony performs better with a pattern-based scheme than with an instance-based one, thus simplifying the procedure. Copyright © 2015 by SCITEPRESS - Science and Technology Publications, Lda.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

DP-Rewrite: Towards Reproducibility and Transparency in Differentially Private Text Rewriting 29

DP-Rewrite: Towards Reproducibility and Transparency in Diff...

引用

29th International Conference on Computational Linguistics, COLING 2022

作者： Igamberdiev, Timour Arnold, Thomas Habernal, Ivan Trustworthy Human Language Technologies Ubiquitous Knowledge Processing Lab Department of Computer Science Technical University of Darmstadt Germany

Text rewriting with differential privacy (DP) provides concrete theoretical guarantees for protecting the privacy of individuals in textual documents. In practice, existing systems may lack the means to validate their privacy-preserving claims, leading to problems of transparency and reproducibility. We introduce DP-Rewrite, an open-source framework for differentially private text rewriting which aims to solve these problems by being modular, extensible, and highly customizable. Our system incorporates a variety of downstream datasets, models, pre-training procedures, and evaluation metrics to provide a flexible way to lead and validate private text rewriting research. To demonstrate our software in practice, we provide a set of experiments as a case study on the ADePT DP text rewriting system, detecting a privacy leak in its pre-training approach. Our system is publicly available, and we hope that it will help the community to make DP text rewriting research more accessible and transparent. © 2022 Proceedings - International Conference on Computational Linguistics, COLING. All rights reserved.

关键词： Transparency

来源：评论

学校读者我要写书评

暂无评论

An empirical investigation of the k2 metric 6

引用

6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU 2001

作者： Borgelt, Christian Kruse, Rudolf Department of Knowledge Processing and Language Engineering Otto-von-Guericke-University of Magdeburg Universitatsplatz 2 MagdeburgD-39106 Germany

ISBN: (纸本)9783540424642

The K2 metric is a well-known evaluation measure (or scoring function) for learning Bayesian networks from data [7]. It is derived by assuming uniform prior distributions on the values of an attribute for each possible instantiation of its parent attributes. This assumption introduces a tendency to select simpler network structures. In this paper we modify the K2 metric in three different ways, introducing a parameter by which the strength of this tendency can be controlled. Our experiments with the ALARM network [2] and the BOBLO network [17] suggest that—somewhat contrary to our expectations—a slightly stronger tendency towards simpler structures may lead to even better results. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

引用

2nd Joint Conference on Lexical and Computational Semantics, *SEM 2013

作者： Zesch, Torsten Levy, Omer Gurevych, Iryna Dagan, Ido Ubiquitous Knowledge Processing Lab Computer Science Department Technische Universität Darmstadt Germany Natural Language Processing Lab Computer Science Department Bar-Ilan University Israel

ISBN: (纸本)9781937284497

Our system combines text similarity measures with a textual entailment system. In the main task, we focused on the influence of lexicalized versus unlexicalized features, and how they affect performance on unseen questions and domains. We also participated in the pilot partial entailment task, where our system significantly outperforms a strong baseline. c 2013 Association for Computational Linguistics

关键词：

来源：评论

学校读者我要写书评

暂无评论

A critique of inductive causation

A critique of inductive causation

引用

5th European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty, ECSQARU 1999

作者： Borgelt, Christian Kruse, Rudolf Department of Knowledge Processing and Language Engineering Otto-von-Guericke-University of Magdeburg Universitätsplatz 2 MagdeburgD-39106 Germany

ISBN: (纸本)354066131X

In this paper we consider the problem of inducing causal relations from statistical data. Although it is well known that a correlation does not justify the claim of a causal relation between two measures, the question seems not to be settled. Research in the eld of Bayesian networks revived an approach suggested in [16]. It is based on the idea that there are relationships between the causal structure of a domain and its corresponding probability distribution, which could be exploited to infer at least part of the causal structure from a set of dependence and independence statements. This idea was developed into the inductive causation algorithm [14]. We review this algorithm and examine the assumptions underlying it. © Springer-Verlag Berlin Heidelberg 1999.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

Recognizing partial textual entailment

Recognizing partial textual entailment

引用

51st Annual Meeting of the Association for Computational Linguistics, ACL 2013

作者： Levy, Omer Zesch, Torsten Dagan, Ido Gurevych, Iryna Natural Language Processing Lab. Computer Science Department Bar-Ilan University Israel Ubiquitous Knowledge Processing Lab. Computer Science Department Technische Universität Darmstadt Germany

ISBN: (纸本)9781937284510

Textual entailment is an asymmetric relation between two text fragments that describes whether one fragment can be inferred from the other. It thus cannot capture the notion that the target fragment is "almost entailed" by the given text. The recently suggested idea of partial textual entailment may remedy this problem. We investigate partial entailment under the faceted entailment model and the possibility of adapting existing textual entailment methods to this setting. Indeed, our results show that these methods are useful for recognizing partial entailment. We also provide a preliminary assessment of how partial entailment may be used for recognizing (complete) textual entailment. © 2013 Association for Computational Linguistics.

关键词： Text processing

来源：评论

学校读者我要写书评

暂无评论

Temporal pattern mining

Temporal pattern mining

引用

作者： Kruse, Rudolf Steinbrechery, Matthias Moewesz, Christian Department of Knowledge Processing and Language Engineering Otto-von-Guericke University of Magdeburg Universitätsplatz 2 39106 Magdeburg Germany

ISBN: (纸本)9788390474342

Data analysis has become an integral part in many economic fields. In this paper, we present several real-world applications occurring in the fields of automobile development and manufacturing, finance, and online communities. The given examples share one aspect in common: time. It is not only the fact to find patterns inside data volumes but also to identify them based on their temporal behaviour. We will give examples of dealing with different models of incorporating the temporal aspects. Furthermore some new results in the area of Visual Data Analysis are presented. These methods offer intuitive methods of guiding the user through the process of data and model inspection and assist in drawing conclusions with the help of meaningful graphical representations. Copyright © 2010 by Institute of Electronics, Silesian University of Technology.

关键词： Data handling

来源：评论

学校读者我要写书评

暂无评论

An implementation of the FP-growth algorithm

An implementation of the FP-growth algorithm

引用

1st International Workshop on Open Source Data Mining: Frequent Pattern Mining Implementations, OSDM 2005, held in conjunction with the 11th ACM SIGKDD International Conference on knowledge Discovery and Data Mining

作者： Borgelt, Christian Department of Knowledge Processing and Language Engineering School of Computer Science Otto-von-Guericke-University of Magdeburg Universitätsplatz 2 39106 Magdeburg Germany

ISBN: (纸本)1595932100

The FP-growth algorithm is currently one of the fastest approaches to frequent item set mining. In this paper I describe a C implementation of this algorithm, which contains two variants of the core operation of computing a projection of an FP-tree (the fundamental data structure of the FP-growth algorithm). In addition, projected FP-trees are (optionally) pruned by removing items that have become infrequent due to the projection (an approach that has been called FP-Bonsai). I report experimental results comparing this implementation of the FP-growth algorithm with three other frequent item set mining algorithms I implemented (Apriori, Eclat, and Relim). Copyright 2005 ACM.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

Fuzzy frequent pattern discovering based on recursive elimination

Fuzzy frequent pattern discovering based on recursive elimin...

引用

ICMLA 2005: 4th International Conference on Machine Learning and Applications

作者： Xiaomeng, Wang Borgelt, Christian Kruse, Rudolf Department of Knowledge Processing and Language Engineering School of Computer Science Otto-von-Guericke-University of Magdeburg Universitätsplatz 2 39106 Magdeburg Germany

ISBN: (纸本)0769524958

Real life transaction data often miss some occurrences of items that are actually present. As a consequence some potentially interesting frequent patterns cannot be discovered, since with exact matching the number of supporting transactions may be smaller than the user-specified minimum. In order to allow approximate matching during the mining process, we propose an approach based on transaction editing. Our recursive algorithm relies on a step by step elimination of items from the transaction database together with a recursive processing of transaction subsets. This algorithm works without complicated data structures and allows us to find fuzzy frequent patterns easily. © 2005 IEEE.

关键词： Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共7页 << < 1 2 3 4 5 6 7 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：