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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

24 篇 会议
22 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

29 篇 工学
- 26 篇 计算机科学与技术...
- 23 篇 软件工程
- 7 篇 信息与通信工程
- 5 篇 控制科学与工程
- 3 篇 网络空间安全
- 1 篇 光学工程
- 1 篇 电子科学与技术（可...
- 1 篇 生物工程
17 篇 管理学
- 14 篇 图书情报与档案管...
- 4 篇 管理科学与工程(可...
15 篇 理学
- 10 篇 数学
- 5 篇 物理学
- 4 篇 统计学（可授理学、...
- 1 篇 生物学
- 1 篇 系统科学
1 篇 医学
- 1 篇 基础医学(可授医学...
- 1 篇 临床医学

主题

4 篇 semantics
2 篇 contrastive lear...
2 篇 embeddings
2 篇 image classifica...
1 篇 computer science
1 篇 object detection
1 篇 collaborative fi...
1 篇 semantic segment...
1 篇 angular distribu...
1 篇 computational co...
1 篇 textbooks
1 篇 task analysis
1 篇 indexes
1 篇 trees (mathemati...
1 篇 reflection
1 篇 image segmentati...
1 篇 dynamic walk
1 篇 computational ne...
1 篇 image edge detec...
1 篇 contact trace

机构

12 篇 school of comput...
9 篇 key lab. of inte...
8 篇 peng cheng labor...
8 篇 school of cyber ...
7 篇 key laboratory o...
5 篇 universidad iber...
5 篇 centro brasileir...
5 篇 technical univer...
5 篇 cukurova univers...
5 篇 brunel universit...
5 篇 lappeenranta uni...
5 篇 yerevan physics ...
5 篇 academy of scien...
5 篇 institut für hoc...
5 篇 institute of inf...
5 篇 institute for nu...
5 篇 national scienti...
5 篇 dsm/irfu cea/sac...
5 篇 sungkyunkwan uni...
5 篇 imperial college...

作者

17 篇 huang qingming
11 篇 xu qianqian
9 篇 cao xiaochun
8 篇 yang zhiyong
6 篇 wang zitai
5 篇 jiang shuqiang
5 篇 liu jun
4 篇 t. miceli
4 篇 g. tonelli
4 篇 k. sogut
4 篇 d. barney
4 篇 t. danielson
4 篇 e. casimiro lina...
4 篇 w. busza
4 篇 m. de gruttola
4 篇 s. carrillo more...
4 篇 p. eerola
4 篇 a. garcia-bellid...
4 篇 m. zielinski
4 篇 n. cartiglia

语言

44 篇 英文
2 篇 其他

检索条件"机构=CAS Key Lab. Network Data Science and Tech."

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

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

详细简洁

排序：

Optimal algorithm for profiling dynamic arrays with finite values 22

Optimal algorithm for profiling dynamic arrays with finite v...

引用

22nd International Conference on Extending database tech.ology, EDBT 2019

作者： Yang, Dingcheng Yu, Wenjian Deng, Junhui Liu, Shenghua BNRist Dept. Computer Science and Tech. Tsinghua Univ. Beijing China CAS Key Lab. Network Data Science and Tech. Inst. Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783893180813

How can one quickly answer the most and top popular objects at any time, given a large log stream in a system of billions of users? It is equivalent to find the mode and top-frequent elements in a dynamic array corresponding to the log stream. However, most existing work either restrain the dynamic array within a sliding window, or do not take advantages of only one element can be added or removed in a log stream. Therefore, we propose a profiling algorithm, named S-Profile, which is of O(1) time complexity for every updating of the dynamic array, and optimal in terms of computational complexity. With the profiling results, answering the queries on the statistics of dynamic array becomes trivial and fast. With the experiments of various settings of dynamic arrays, our accurate S-Profile algorithm outperforms the existing methods, showing at least 2X speedup to the heap based approach and 13X speedup to the balanced tree based approach. © 2019 Copyright held by the owner/author(s).

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

A cross-lingual joint aspect/sentiment model for sentiment analysis 14

A cross-lingual joint aspect/sentiment model for sentiment a...

引用

23rd ACM International Conference on Information and Knowledge Management, CIKM 2014

作者： Lin, Zheng Jin, Xiaolong Xu, Xueke Wang, Yuanzhuo Wang, Weiping Cheng, Xueqi Minzhuang Road Beijing China Key Lab. of Network Data Science and Technology ICT CAS No. 6 Kexueyuan South Road Beijing China

ISBN: (纸本)9781450325981

Sentiment analysis in various languages has been a research hotspot with many applications. However, sentiment resources (e.g., lab.led corpora, sentiment lexicons) of different languages are unbalanced in terms of quality and quantity, which arouses interests in cross-lingual sentiment analysis aiming at using the resources in a source language to improve sentiment analysis in a target language. Nevertheless, many existing cross-lingual related works rely on a certain machine translation system to directly adapt the lab.led data from the source language to the target language, which usually suffers from inaccurate results generated by the machine translation system. On the other hand, most sentiment analysis studies focus on document-level sentiment classification that cannot solve the aspect dependency problem of sentiment words. For instance, in the reviews on a cell phone, long is positive for the lifespan of its battery, but negative for the response time of its operating system. To solve these problems, this paper develops a novel Cross-Lingual Joint Aspect/Sentiment (CLJAS) model to carry out aspect-specific sentiment analysis in a target language using the knowledge learned from a source language. Specifically, the CLJAS model jointly detects aspects and sentiments of two languages simultaneously by incorporating sentiments into a cross-lingual topic model framework. Extensive experiments on different domains and different languages demonstrate that the proposed model can significantly improve the accuracy of sentiment classification in the target language. Copyright 2014 ACM.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

AUCSeg: AUC-oriented Pixel-level Long-tail Semantic Segmentation 38

AUCSeg: AUC-oriented Pixel-level Long-tail Semantic Segmenta...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Han, Boyu Xu, Qianqian Yang, Zhiyong Bao, Shilong Wen, Peisong Jiang, Yangbangyan Huang, Qingming Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China School of Computer Science and Tech. University of Chinese Academy of Sciences China Peng Cheng Laboratory China Key Laboratory of Big Data Mining and Knowledge Management CAS China

The Area Under the ROC Curve (AUC) is a well-known metric for evaluating instance-level long-tail learning problems. In the past two decades, many AUC optimization methods have been proposed to improve model performance under long-tail distributions. In this paper, we explore AUC optimization methods in the context of pixel-level long-tail semantic segmentation, a much more complicated scenario. This task introduces two major challenges for AUC optimization tech.iques. On one hand, AUC optimization in a pixel-level task involves complex coupling across loss terms, with structured inner-image and pairwise inter-image dependencies, complicating theoretical analysis. On the other hand, we find that mini-batch estimation of AUC loss in this case requires a larger batch size, resulting in an unaffordable space complexity. To address these issues, we develop a pixel-level AUC loss function and conduct a dependency-graph-based theoretical analysis of the algorithm's generalization ability. Additionally, we design a Tail-Classes Memory Bank (T-Memory Bank) to manage the significant memory demand. Finally, comprehensive experiments across various benchmarks confirm the effectiveness of our proposed AUCSeg method. The code is availab.e at https://***/boyuh/AUCSeg. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Context-adaptive matrix factorization for multi-context recommendation 15

Context-adaptive matrix factorization for multi-context reco...

引用

24th ACM International Conference on Information and Knowledge Management, CIKM 2015

作者： Man, Tong Shen, Huawei Huang, Junming Cheng, Xueqi CAS Key Lab. of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China CompleX Lab. Web Sciences Center University of Electronic Science and Technology of China Chengdu611731 China

ISBN: (纸本)9781450337946

data sparsity is a long-standing challenge for recommender systems based on collab.rative filtering. A promising solution for this problem is multi-context recommendation, i.e., leveraging users' explicit or implicit feedback from multiple contexts. In multi-context recommendation, various types of interactions between entities (users and items) are combined to alleviate data sparsity of a single context in a collective manner. Two issues are crucial for multi-context recommendation: (1) How to differentiate context-specific factors from entity-intrinsic factors shared across contexts? (2) How to capture the salient phenomenon that some entities are insensitive to contexts while others are remarkably context-dependent? Previous methods either do not consider context-specific factors, or assume that a context imposes equal influence on different entities, limiting their capability of combating data sparsity problem by taking full advantage of multiple contexts. In this paper, we propose a context-adaptive matrix factorization method for multi-context recommendation by simultaneously modeling context-specific factors and entity-intrinsic factors in a unified model. We learn an entity-intrinsic latent factor for every entity, and a context-specific latent factor for every entity in each context. Meanwhile, using a context-entity mixture parameter matrix we explicitly model the extent to which each context imposes influence on each entity. Experiments on two real scenarios demonstrate that our method consistently outperforms previous multi-context recommendation methods on all different sparsity levels. Such a consistent performance promotion forms the unique superiority of our method, enabling it to be a reliable model for multi-context recommendation. © 2015 ACM.

关键词： Collab.rative filtering

来源：评论

学校读者我要写书评

暂无评论

On the optimality of tape merge of two lists with similar size 27

On the optimality of tape merge of two lists with similar si...

引用

27th International Symposium on Algorithms and Computation, ISAAC 2016

作者： Li, Qian Sun, Xiaoming Zhang, Jialin CAS Key Lab. of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783959770262

The problem of merging sorted lists in the least number of pairwise comparisons has been solved completely only for a few special cases. Graham and Karp [18] independently discovered that the tape merge algorithm is optimal in the worst case when the two lists have the same size. Stockmeyer and Yao[28], Murphy and Paull[24], and Christen[6] independently showed when the lists to be merged are of size m and n satisfying m ≤ n ≤ ⌊3/2m⌋ + 1, the tape merge algorithm is optimal in the worst case. This paper extends this result by showing that the tape merge algorithm is optimal in the worst case whenever the size of one list is no larger than 1.52 times the size of the other. The main tool we used to prove lower bounds is Knuth's adversary methods [18]. In addition, we show that the lower bound cannot be improved to 1.8 via Knuth's adversary methods. We also develop a new inequality about Knuth's adversary methods, which might be interesting in its own right. Moreover, we design a simple procedure to achieve constant improvement of the upper bounds for 2m - 2 ≤ n ≤ 3m. © Qian Li, Xiaoming Sun, and Jialin Zhang.

关键词： Mergers and acquisitions

来源：评论

学校读者我要写书评

暂无评论

Learning to identify core term of knowledge unit from short text

Learning to identify core term of knowledge unit from short ...

引用

2012 9th International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2012

作者： Tian, Zhenhua Wang, Zhen Liu, Ziqi Xiang, Hengheng Liu, Jun Zheng, Qinghua Shaanxi Province Key Lab. of Satellite and Terrestrial Network Tech. RandD Department of Computer Science and Technology Xi'An Jiaotong University Shaanxi 710049 China

ISBN: (纸本)9781467300223

We present a new task of identifying core term (CT) of knowledge unit (KU) from text for knowledge management and service. Two kinds of approaches, including binary classification using naïve bayesian, decision tree, logistic regression and SVM, as well as competition learning based on pairwise classification, are investigated for this specific task, combined with presented rich feature set from position, token features to statistic and linguistic features. Experimental results show that simple classification method can effectively address this task with desirable performance at 82.7% KU accuracy. However, since the recognition of core term relies on the KU as an integer and all its inner terms, competition learning based on pairwise classification achieves better result at 89.6%. We also empirically show that all of the presented types of features are useful for our task, and the combination of position and linguistic features is essential for information extraction on short text. © 2012 IEEE.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

Suppress Content Shift: Better Diffusion Features via Off-the-Shelf Generation tech.iques 38

Suppress Content Shift: Better Diffusion Features via Off-th...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Meng, Benyuan Xu, Qianqian Wang, Zitai Yang, Zhiyong Cao, Xiaochun Huang, Qingming Institute of Information Engineering CAS China School of Cyber Security University of Chinese Academy of Sciences China Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China Peng Cheng Laboratory China School of Computer Science and Tech. University of Chinese Academy of Sciences China School of Cyber Science and Tech. Shenzhen Campus of Sun Yat-sen University China Key Laboratory of Big Data Mining and Knowledge Management CAS China

Diffusion models are powerful generative models, and this capability can also be applied to discrimination. The inner activations of a pre-trained diffusion model can serve as features for discriminative tasks, namely, diffusion feature. We discover that diffusion feature has been hindered by a hidden yet universal phenomenon that we call content shift. To be specific, there are content differences between features and the input image, such as the exact shape of a certain object. We locate the cause of content shift as one inherent characteristic of diffusion models, which suggests the broad existence of this phenomenon in diffusion feature. Further empirical study also indicates that its negative impact is not negligible even when content shift is not visually perceivable. Hence, we propose to suppress content shift to enhance the overall quality of diffusion features. Specifically, content shift is related to the information drift during the process of recovering an image from the noisy input, pointing out the possibility of turning off-the-shelf generation tech.iques into tools for content shift suppression. We further propose a practical guideline named GATE to efficiently evaluate the potential benefit of a tech.ique and provide an implementation of our methodology. Despite the simplicity, the proposed approach has achieved superior results on various tasks and datasets, validating its potential as a generic booster for diffusion features. Our code is availab.e at this url. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Not All Diffusion Model Activations Have Been Evaluated as Discriminative Features 38

Not All Diffusion Model Activations Have Been Evaluated as D...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Meng, Benyuan Xu, Qianqian Wang, Zitai Cao, Xiaochun Huang, Qingming Institute of Information Engineering CAS China School of Cyber Security University of Chinese Academy of Sciences China Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China Peng Cheng Laboratory China School of Cyber Science and Tech. Shenzhen Campus of Sun Yat-sen University China School of Computer Science and Tech. University of Chinese Academy of Sciences China Key Laboratory of Big Data Mining and Knowledge Management CAS China

Diffusion models are initially designed for image generation. Recent research shows that the internal signals within their backbones, named activations, can also serve as dense features for various discriminative tasks such as semantic segmentation. Given numerous activations, selecting a small yet effective subset poses a fundamental problem. To this end, the early study of this field performs a large-scale quantitative comparison of the discriminative ability of the activations. However, we find that many potential activations have not been evaluated, such as the queries and keys used to compute attention scores. Moreover, recent advancements in diffusion architectures bring many new activations, such as those within embedded ViT modules. Both combined, activation selection remains unresolved but overlooked. To tackle this issue, this paper takes a further step with a much broader range of activations evaluated. Considering the significant increase in activations, a full-scale quantitative comparison is no longer operational. Instead, we seek to understand the properties of these activations, such that the activations that are clearly inferior can be filtered out in advance via simple qualitative evaluation. After careful analysis, we discover three properties universal among diffusion models, enabling this study to go beyond specific models. On top of this, we present effective feature selection solutions for several popular diffusion models. Finally, the experiments across multiple discriminative tasks validate the superiority of our method over the SOTA competitors. Our code is availab.e at this url. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Analysis of the paragraph vector model for information retrieval 16

Analysis of the paragraph vector model for information retri...

引用

2016 ACM International Conference on the Theory of Information Retrieval, ICTIR 2016

作者： Ai, Qingyao Yang, Liu Guo, Jiafeng Croft, W. Bruce College of Information and Computer Sciences University of Massachusetts Amherst AmherstMA United States CAS Key Lab. of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9781450344975

Previous studies have shown that semantically meaningful representations of words and text can be acquired through neural embedding models. In particular, paragraph vector (PV) models have shown impressive performance in some natural language processing tasks by estimating a document (topic) level language model. Integrating the PV models with traditional language model approaches to retrieval, however, produces unstable performance and limited improvements. In this paper, we formally discuss three intrinsic problems of the original PV model that restrict its performance in retrieval tasks. We also describe modifications to the model that make it more suitable for the IR task, and show their impact through experiments and case studies. The three issues we address are (1) the unregulated training process of PV is vulnerable to short document overfitting that produces length bias in the final retrieval model;(2) the corpus-based negative sampling of PV leads to a weighting scheme for words that overly suppresses the importance of frequent words;and (3) the lack of word-context information makes PV unable to capture word substitution relationships. © 2016 ACM.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

Modeling parameter interactions in ranking SVM 15

Modeling parameter interactions in ranking SVM

引用

24th ACM International Conference on Information and Knowledge Management, CIKM 2015

作者： Zhang, Yaogong Xu, Jun Lan, Yanyan Guo, Jiafeng Xie, Maoqiang Huang, Yalou Cheng, Xueqi College of Computer and Control Engineering Nankai University China CAS Key Lab. of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China College of Software Nankai University China

ISBN: (纸本)9781450337946

Ranking SVM, which formalizes the problem of learning a ranking model as that of learning a binary SVM on preference pairs of documents, is a state-of-the-art ranking model in information retrieval. The dual form solution of Ranking SVM model can be written as a linear combination of the preference pairs, i.e., w = Σ(i,j)αij(xi - xj), where αij denotes the Lagrange parameters associated with each pair (i,j). It is obvious that there exist significant interactions over the document pairs because two preference pairs could share a same document as their items. Thus it is natural to ask if there also exist interactions over the model parameters αij, which we may leverage to propose better ranking model. This paper aims to answer the question. Firstly, we found that there exists a low-rank structure over the Ranking SVM model parameters αij, which indicates that the interactions do exist. Then, based on the discovery, we made a modification on the original Ranking SVM model by explicitly applying a low-rank constraint to the parameters. Specifically, each parameter αij is decomposed as a product of two low-dimensional vectors, i.e., αij = (υi,υj), where vectors vi and vj correspond to document i and j, respectively. The learning process, thus, becomes to optimize the modified dual form objective function with respect to the low-dimensional vectors. Experimental results on three LETOR datasets show that our method, referred to as Factorized Ranking SVM, can outperform state-of-the-art baselines including the conventional Ranking SVM. © 2015 ACM.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：