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

Research on the Matthews correlation coefficients metrics of personalized recommendation algorithm evaluation

International Journal of Hybrid Information technology 2015年第1期8卷 163-172页

作者： Liu, Yingbo Cheng, Jiujun Yan, Chendan Wu, Xiao Chen, Fuzhen Key Laboratory of Embedded System and Service Computing of Ministry of Education Tongji University Shanghai China Department of Computer Science and Technology Tongji University Shanghai China

The personalized recommendation systems could better improve the personalized service for network user and alleviate the problem of information overload in the Internet. As we all know, the key point of being a successful recommendation system is the performance of recommendation algorithm. When scholars put forward some new recommendation algorithms, they claim that the new algorithms have been improved in some respects, better than previous algorithm. So we need some evaluation metrics to evaluate the algorithm performance. Due to the scholar didn’t fully understand the evaluation mechanism of recommendation algorithms. They mainly emphasized some specific evaluation metrics like Accuracy, Diversity. What’s more, the academia did not establish a complete and unified assessment of recommendation algorithms evaluation system which is credibility to do the work of recommendation evaluation. So how to do this work objective and reasonable is still a challengeable task. In this article, we discussed the present evaluation metrics with its respective advantages and disadvantages. Then, we put forward to use the Matthews Correlation Coefficient to evaluate the recommendation algorithm’s performance. All this based on an open source projects called mahout which provides a rich set of components to construct the classic recommendation algorithm. The results of the experiments show that the applicability of Matthews correlation coefficient in the relative evaluation work of recommendation algorithm. © 2015 SERSC.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Mining World Indicators for Analyzing and Modeling the Development of Countries

引用

ACM/IMS Transactions on Data Science 2021年第4期2卷 1–27页

作者： Huang, Hong Chi, Mingyuan Song, Yu Jin, Hai The National Engineering Research Center for Big Data Technology and System Key Laboratory of Service Computing Technology and System Ministry of Education School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

The world indicators released by the World Bank or other organizations usually give the basic public knowledge about the world. However, separate and static index lacks the complex interplay among different indicators and thus cannot help us have an overall understanding of the world. To this end, we study the world indicators from a different angle. Firstly, we discover that there exist correlations between indicators either from a static view or from a dynamic view. Moreover, taking the trade and diplomatic relationships into consideration, we construct a multi-relational network to depict the interactions between different countries, and propose a Multiple Relations to Vector (MR2vec) model to study world indicators from a network perspective. The experimental results show the changes of world indicators are predictable with the proposed model, and our proposed MR2vec has wide adaptability in predicting multi-relation networks. © 2022 Copyright held by the owner/author(s).

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

A Reduced Reachability Tree for a Class of Unbounded Petri Nets

引用

IEEE/CAA Journal of Automatica Sinica 2015年第4期2卷 345-352页

作者： Shouguang Wang Mengdi Gan Mengchu Zhou Dan You School of Information and Electronic Engineering Zhejiang Gongshang University State Key Laboratory for Manufacturing Systems Engineering Xi’an Jiaotong University Ministry of Education(MoE)Key Laboratory of Embedded System and Service Computing Tongji University MoE Key Laboratory of Embedded System and Service Computing Tongji University Department of Electrical and Computer Engineering New Jersey Institute of Technology

As a powerful analysis tool of Petri nets, reachability trees are fundamental for systematically investigating many characteristics such as boundedness, liveness and reversibility. This work proposes a method to generate a reachability tree, called ωRT for short, for a class of unbounded generalized nets called ω-independent nets based on new modified reachability trees (NMRTs). ωRT can effectively decrease the number of nodes by removing duplicate and ω-duplicate nodes in the tree, and verify properties such as reachability, liveness and deadlocks. Two examples are provided to show its superiority over NMRTs in terms of tree size. © 2014 Chinese Association of Automation.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

A effective clustering indexing based on EMD for Web image retrieval

A effective clustering indexing based on EMD for Web image r...

引用

2008 the 1st IEEE International Conference on Ubi-Media computing and Workshops, U-Media2008

作者： Tao, Wenbing Luo, Feng Service Computing Technology and System Laboratory Ministry of Education Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9781424418657

In this paper, we develop an effective clustering indexing scheme based on Earth Movers' Distance (EMD) for Web image retrieval. By the proposed clustering method, the collected web images can be automatically classified into some image subclasses with the number of the elements less than a given threshold. Then the resulted clustering structure is hierarchical tree, which extremely facilitate to quickly locate the similar image subclass nodes. Additionally, a triple tree structure is presented to effectively represent hierarchical clustering tree, and a query scheme based on approximative EMD measure is developed to achieve fast image retrieval based on the sample image. The experimental results also demonstrate the excellent performance of the proposed method. © 2008 IEEE.

关键词： Indexing (of information)

来源：评论

学校读者我要写书评

暂无评论

Integrating image clustering and memory indexing for large scale content-based image retrieval

Integrating image clustering and memory indexing for large s...

引用

MIPPR 2009 - Remote Sensing and GIS Data Processing and Other Applications: 6th International Symposium on Multispectral Image Processing and Pattern Recognition

作者： Tao, Wenbing Jin, Hai Luo, Feng Wu, Kun Service Computing Technology and System Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9780819478092

Content-Based Image Retrieval (CBIR) is an important research topic of information retrieval, involved in computer graphics, image processing, data mining and pattern recognizing. To make content-based image retrieval suitable large-scale image database, we develop an effective dynamic hierarchical clustering index scheme. Although this system uses a hierarchical clustering technology, with the increasing in the number of cluster centers, it is slow to find the centers, and it becomes a system performance bottleneck. In this paper, content features of image memory indexing is built. This method effectively improves the retrieval speed without loss of the precision. Moreover, the clustering model was improved, integrating the content features and textual features of image, which greatly improve the accuracy of the clustering, thus significantly improves the system precision. © 2009 Copyright SPIE - The International Society for Optical Engineering.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Constructing prioritized interaction test suite with interaction relationship

Constructing prioritized interaction test suite with interac...

引用

2nd International Workshop on Education technology and Computer Science, ETCS 2010

作者： Yuan, Jianjun Jiang, Zuowen Key Laboratory of Embedded System and Service Computing Ministry of Education of China Tongji University Shanghai China Department of Computer Science and Technology Key Laboratory of Embedded System and Service Computing Tongji University Shanghai China

ISBN: (纸本)9780769539874

Interaction testing has addressed some issues on how to select a small subset of test cases. In many systems where interaction testing is needed, the entire test suite is not executed because of time or budget constraints. It is important to prioritize the test cases in these situations. On the other hand, there are not always interactions among any factors in real systems. Moreover, some factors may need N-way (N>2) testing since there is a closer relationship among them. We present a model for prioritized interaction testing with interaction relationship and propose a greedy algorithm for generating variable strength covering arrays with bias. © 2010 IEEE.

关键词： Testing

来源：评论

学校读者我要写书评

暂无评论

Large-scale video compression： recent advances and challenges

引用

Frontiers of Computer Science 2018年第5期12卷 825-839页

作者： Tao TIAN Hanli WANG Department of Computer Science and Technology Tongji University Shanghai 201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China Shanghai Engineering Research Center of Industrial Vision Perception & Intelligent Computing Shanghai 200092 China

The evolution of social network and multimedia technologies encourage more and more people to generate and upload visual information, which leads to the generation of large-scale video data. Therefore, preeminent compression technologies are highly desired to facilitate the storage and transmission of these tremendous video data for a wide variety of applications. In this paper, a systematic review of the recent advances for large-scale video compression （LSVC） is presented. Specifically, fast video coding algorithms and effective models to improve video compression efficiency are introduced in detail, since coding complexity and compression efficiency are two important factors to evaluate video coding approaches. Finally, the challenges and fu- ture research trends for LSVC are discussed.

关键词： large-scale video compression fast video coding compression efficiency

来源：评论

学校读者我要写书评

暂无评论

Will the fibers of the future be considered fibers?

引用

National Science Review 2024年第10期11卷 15-17页

作者： Dewen Xu Ya Liu Hailiang Wang Wei Yan Changjun Jiang Meifang Zhu State Key Laboratory for Modification of Chemical Fibers and Polymer Materials College of Materials Science and Engineering Donghua University Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Department of Computer Science and Technology Tongji University

Fiber materials are key materials that have changed human history and promoted the progress of human civilization. In ancient times, humans used feathers and animal skins for clothing, and later they widely employed natural fibers such as cotton, hemp, silk and wool to make fabrics(Fig. 1a). Chinese ancestors had mastered the art of natural fiber weaving as early as the Neolithic *** thousand years ago, people were already familiar with and adept at techniques for spinning natural fibers [1].

关键词： future will considered fibers

来源：评论

学校读者我要写书评

暂无评论

Automatic Web services composition algorithm based on optimal matching

引用

Journal of Central South University 2011年第4期18卷 1169-1177页

作者：王俊丽丁志军侯玉兵 Engineering Research Center for Enterprise Digital Technology Ministry of EducationTongji University Key Laboratory of Embedded System and Service Computing Ministry of EducationTongji University Shanghai Branch China Information Technology Designing and Consulting Institute

A novel layered method was proposed to solve the problem of Web services *** this method,services composition problem was formally transformed into the optimal matching problem of every layer,then optimal matching problem was modeled based on the hypergraph theory,and solved by computing the minimal transversals of the ***,two optimization algorithms were designed to discard some useless states at the intermediary steps of the composition *** effectiveness of the composition method was tested by a set of experiments,in addition,an example regarding the travel services composition was also *** experimental results show that this method not only can automatically generate composition tree whose leaf nodes correspond to services composition solutions,but also has better performance on execution time and solution quality by adopting two proposed optimization algorithms.

关键词： Web services services composition optimal matching hypergraph theory

来源：评论

学校读者我要写书评

暂无评论

Construction algorithms for index model based on Web page classification

引用

Journal of Computational Information systems 2014年第2期10卷 655-664页

作者： Zhang, Yangjie Yan, Chungang Wang, Pengwei Sun, Haichun Department of Computer Science and Technology Tongji University Shanghai 201804 China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China

Web pages on the Internet are massive, diverse, heterogeneous and redundant. How to organize and manage them effectively is an urgent problem. In this paper, we propose a method to index web pages and build an index model based on web page classification and hyperlink analysis. First, an initialization algorithm is given to construct an index model for an initial set of web pages. Then, considering the dynamics of web pages on the Internet, we propose an incremental updating algorithm which can update an index model incrementally. Through theoretical analysis, the complexity of proposed algorithms shows linear relationships with the scale of web pages and their growth. The experimental results show that initialization algorithm can construct an index model for a fixed number of web pages relatively fast, while the incremental updating algorithm can satisfy the update speed of web pages on the Internet. Thus, the proposed algorithms are feasible and effective. The constructed index model can provide supports for diversified information service systems to enable them to make better use of web resources and provide more valuable services to users. Copyright © 2014 Binary Information Press.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：