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

Combined pattern mining: From learned rules to ationable knowledge

21st Australasian Joint Conference on Artificial Intelligence, AI 2008

作者： Zhao, Yanchang Zhang, Huaifeng Cao, Longbing Zhang, Chengqi Bohlscheid, Hans Data Sciences and Knowledge Discovery Research Lab. Faculty of Engineering and IT University of Technology Sydney Australia Projects Section Business Integrity Programs Branch Centrelink Australia

ISBN: (纸本)3540893776

Association mining often produces large collections of association rules that are difficult to understand and put into action. In this paper, we have designed a novel notion of combined patterns to extract useful and actionable knowledge from a large amount of learned rules. We also present definitions of combined patterns, design novel metrics to measure their interestingness and analyze the redundancy in combined patterns. Experimental results on real-life social security data demonstrate the effectiveness and potential of the proposed approach in extracting actionable knowledge from complex data. © 2008 Springer Berlin Heidelberg.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

On-Line System of Garbage Image-Orientated Intelligent Classification, Submission and Examination 20

On-Line System of Garbage Image-Orientated Intelligent Class...

引用

20th IEEE International Conference on e-Business engineering, ICEBE 2024

作者： Tian, Jiayin Wang, Yaozhi Liu, Jiaxin Chen, Yan School of Computer Science and Technology Xi'an Jiaotong University Shaanxi Xi'an China Xi'an Jiaotong University Shaanxi Key Lab of Big Data Knowledge Engineering Shaanxi Xi'an China School of Computer Science and Technology Xi'an Jiaotong University Xi'an Jiaotong University Shaanxi Key Lab of Big Data Knowledge Engineering Shaanxi Xi'an China

ISBN: (纸本)9798350365856

In a world brimming with new products continually, novel waste types are ubiquitous. This makes current image-based garbage classification systems difficult to perform well due to the long-tailed effects of distribution of garbage types, and necessitates an urgent and efficient garbage classification with abilities of detecting new and rare wastes and class-incremental learning for environmental sustainability. Therefore, we propose a framework of Online System of Garbage Image-Oriented Intelligent Classification, Submission, and Examination, facilitating the incremental garbage classification efforts. In which, to identify novel garbage effectively, we also introduced few-shot object detection method with two key algorithms: Two-Stage Object Detection Learning Algorithm and Dynamic Query-based Incremental Few-shot Learning Algorithm. Our experiment results show that Both outperform the current existing ones in dataset, MS COCO. Then, a strategy of Class-Incremental learning based Residual Network is proposed to meet the need of new waste class-incremental learning. The experimental results support our strategy. Finally, a prototype system employed the above algorithms and the strategy is described. © 2024 IEEE.

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

Article reranking by memory-enhanced key sentence matching for detecting previously fact-checked claims 59

Article reranking by memory-enhanced key sentence matching f...

引用

Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, ACL-IJCNLP 2021

作者： Sheng, Qiang Cao, Juan Zhang, Xueyao Li, Xirong Zhong, Lei Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China Key Lab of Data Engineering and Knowledge Engineering Renmin University of China China

ISBN: (纸本)9781954085527

False claims that have been previously fact-checked can still spread on social media. To mitigate their continual spread, detecting previously fact-checked claims is indispensable. Given a claim, existing works retrieve fact-checking articles (FC-articles) for detection and focus on reranking candidate articles in the typical two-stage retrieval framework. However, their performance may be limited as they ignore the following characteristics of FC-articles: (1) claims are often quoted to describe the checked events, providing lexical information besides semantics;and (2) sentence templates to introduce or debunk claims are common across articles, providing pattern information. In this paper, we propose a novel reranker, MTM (Memoryenhanced Transformers for Matching), to rank FC-articles using key sentences selected using event (lexical and semantic) and pattern information. For event information, we propose to finetune the Transformer with regression of ROUGE. For pattern information, we generate pattern vectors as a memory bank to match with the parts containing patterns. By fusing event and pattern information, we select key sentences to represent an article and then predict if the article fact-checks the given claim using the claim, key sentences, and patterns. Experiments on two real-world datasets show that MTM outperforms existing methods. Human evaluation proves that MTM can capture key sentences for explanations. The code and the dataset are at https://***/ICTMCG/MTM. © 2021 Association for Computational Linguistics

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Source separation improves music emotion recognition 14

Source separation improves music emotion recognition

引用

2014 4th ACM International Conference on Multimedia Retrieval, ICMR 2014

作者： Xu, Jieping Li, Xirong Hao, Yun Yang, Gang Multimedia Computing Lab. School of Information Renmin University of China Beijing 100872 China Key Lab of Data Engineering and Knowledge Engineering Renmin University of China Beijing 100872 China Graduate School of Library and Information Science University of Illinois at Urbana-Champaign United States

ISBN: (纸本)1595930361

Despite the impressive progress in music emotion recognition, it remains unclear what aspect of a song, i.e., singing voice and accompanied music, carries more emotional information. As an initial attempt to answer the question, we introduce source separation into a standard music emotion recognition system. This allows us to compare systems with and without source separation, and consequently reveal the influence of singing voice and accompanied music on emotion recognition. Classification experiments on a set of 267 songs with *** annotations verify the new finding that source separation improves song music emotion recognition. Copyright is held by the owner/author(s).

关键词： Source separation

来源：评论

学校读者我要写书评

暂无评论

Trajectory simplification: An experimental study and quality analysis 44th

Trajectory simplification: An experimental study and quality...

引用

44th International Conference on Very Large data Bases, VLDB 2018

作者： Zhang, Dongxiang Ding, Mengting Yang, Dingy Liu, Yi Fan, Ju Shen, Heng Tao Center for Future Media School of Computer Science and Engineering UESTC China School of Electronics and Information Shanghai Dian Ji University China The Key Lab of Data Engineering and Knowledge Engineering Renmin University of China China

The ubiquitousness of GPS sensors in smart-phones, vehicles and wearable devices has enabled the collection of massive volumes of trajectory data from tracing moving objects. Consequently, an unprecedented scale of timestamped GPS data has been generated and posed an urgent demand for an effective storage mechanism for trajectory databases. The mainstream compression technique is called trajectory simplification, that finds a subsequence to approximate the original trajectory and attempts to minimize the information loss under a distance measure. Even though various simplification algorithms have been proposed in the past decades, there still lacks a thorough comparison to cover all the state-of-the-art algorithms and evaluate their quality using datasets in diversified motion patterns. Hence, it still remains a challenge for GPS data collectors to determine a proper algorithm in a concrete application. In addition, almost the entire line of previous methods uses error-based metrics to evaluate the compression quality, while ignoring their usability in supporting spatio-temporal queries on top of the reduced database. To bridge these gaps, we conduct so far the most comprehensive evaluation on trajectory simplification techniques. We compare the performance of 25 algorithms in total using five real datasets in different motion patterns. According to the experimental findings, we present useful guidance for the selection or development of effective trajectory simplification algorithms. © VLDB Endowment 21508097/18/05

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

Few-example video event retrieval using tag propagation 14

Few-example video event retrieval using tag propagation

引用

2014 4th ACM International Conference on Multimedia Retrieval, ICMR 2014

作者： Mazloom, Masoud Li, Xirong Snoek, Cees G. M. ISLA Faculty of Science University of Amsterdam Science Park 904 1098 XH Amsterdam Netherlands Key Lab of Data Engineering and Knowledge Engineering Renmin University of China Beijing 100872 China

ISBN: (纸本)1595930361

An emerging topic in multimedia retrieval is to detect a complex event in video using only a handful of video examples. Different from existing work which learns a ranker from positive video examples and hundreds of negative examples, we aim to query web video for events using zero or only a few visual examples. To that end, we propose in this paper a tag-based video retrieval system which propagates tags from a tagged video source to an unlab.led video collection without the need of any training examples. Our algorithm is based on weighted frequency neighbor voting using concept vector similarity. Once tags are propagated to unlab.led video we can rely on off-the-shelf language models to rank these videos by the tag similarity. We study the behavior of our tag-based video event retrieval system by performing three experiments on web videos from the TRECVID multimedia event detection corpus, with zero, one and multiple query examples that beats a recent alternative. Copyright 2014 ACM.

关键词： Image retrieval

来源：评论

学校读者我要写书评

暂无评论

Personalised Multilingual Hypertext retrieval: An overview

Personalised Multilingual Hypertext retrieval: An overview

引用

1st Workshop on Personalised Multilingual Hypertext Retrieval, PMHR 2011, Held in Conjunction with the ACM Hypertext 2011, HT2011

作者： Agosti, Maristella De Luca, Ernesto William Lawless, Séamus Leveling, Johannes Department of Information Engineering University of Padua Italy DAI Lab. Berlin Institute of Technology Germany Knowledge and Data Engineering Group Trinity College Dublin Ireland School of Computing Dublin City University Ireland

ISBN: (纸本)9781450308977

The aims of the workshop on Personalised Multilingual Hypertext Retri eval (PMHR) are twofold: to set the scene in this challenging area, allowing the different communities engaged in related research topics to meet and to determine a program of actions to undertake;to devise a strategy for the evaluation of PMHR systems, which should define the collection of resources to use to evaluate such systems together with the evaluation metrics to use. The workshop results will be of use in the design of personalised tools that can help end-users fully benefit from the use of distributed multilingual hypertext content. © 2011 ACM.

关键词：

来源：评论

学校读者我要写书评

暂无评论

MatchPrompt: Prompt-based Open Relation Extraction with Semantic Consistency Guided Clustering

MatchPrompt: Prompt-based Open Relation Extraction with Sema...

引用

2022 Conference on Empirical Methods in Natural Language Processing, EMNLP 2022

作者： Wang, Jiaxin Zhang, Lingling Liu, Jun Liang, Xi Zhong, Yujie Wu, Yaqiang Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering School of Computer Science and Technology Xi'an Jiaotong University China National Engineering Lab for Big Data Analytics Xi'an Jiaotong University China Lenovo Research Beijing China

Relation clustering is a general approach for open relation extraction (OpenRE). Current methods have two major problems. One is that their good performance relies on large amounts of lab.led and pre-defined relational instances for pre-training, which are costly to acquire in reality. The other is that they only focus on learning a high-dimensional metric space to measure the similarity of novel relations and ignore the specific relational representations of clusters. In this work, we propose a new prompt-based framework named MatchPrompt, which can realize OpenRE with efficient knowledge transfer from only a few predefined relational instances as well as mine the specific meanings for cluster interpretability. To our best knowledge, we are the first to introduce a prompt-based framework for unlab.led clustering. Experimental results on different datasets show that MatchPrompt achieves the new SOTA results for OpenRE. © 2022 Association for Computational Linguistics.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Visual Summarization of the Social Image Collection Using Image Attractiveness Learned from Social Behaviors

Visual Summarization of the Social Image Collection Using Im...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Jin-Woo Jeong Hyun-Ki Hong Jee-Uk Heu Iqbal Qasim Dong-Ho Lee Knowledge & Data Engineering Lab. Hanyang University South Korea

How to effectively summarize a large-scale image collection is still an important and open problem. In this paper, we propose a novel method to effectively generate a summary of the social image collection using image attractiveness learned from the social behaviors conducted in Flickr. To this end, we exploit the note information of Flickr images. The notes of Flickr images are user generated bounding boxes with text annotations assigned on the interesting image regions. Using the visual features extracted from the images that have notes, we have generated the attractiveness models for various concepts. Finally, the attractiveness models are exploited to make a summary of the social image collection. Through various user studies on the image collections from Flickr groups, we show the feasibility of our method and discuss further directions.

关键词： Visualization Feature extraction Search problems Clustering algorithms Vectors Integrated circuit modeling Semantics

来源：评论

学校读者我要写书评

暂无评论

What matters for ad-hoc video search? A large-scale evaluation on TRECVID

arXiv

引用

arXiv 2021年

作者： Chen, Aozhu Hu, Fan Wang, Zihan Zhou, Fangming Li, Xirong AIMC Lab. School of Information Renmin University of China Key Lab of Data Engineering and Knowledge Engineering Renmin University of China

For quantifying progress in Ad-hoc Video Search (AVS), the annual TRECVID AVS task is an important international evaluation. Solutions submitted by the task participants vary in terms of their choices of cross-modal matching models, visual features and training data. As such, what one may conclude from the evaluation is at a high level that is insufficient to reveal the influence of the individual components. In order to bridge the gap between the current solution-level comparison and the desired component-wise comparison, we propose in this paper a large-scale and systematic evaluation on TRECVID. By selected combinations of state-of-the-art matching models, visual features and (pre-)training data, we construct a set of 25 different solutions and evaluate them on the TRECVID AVS tasks 2016–2020. The presented evaluation helps answer the key question of what matters for AVS. The resultant observations and learned lessons are also instructive for developing novel AVS solutions. Copyright © 2021, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：