Based on analysis of relationships between solution qualities and number of initial dynamic points in elastic net algorithm, we propose an improved elastic network algorithm (IENA) introduced in a heuristic cloning st...
详细信息
作者：
[Systems Research Institute
Polish Academy of Sciences Warsaw and University of Gdansk Warsaw Poland Systems Research Institute
Polish Academy of Sciences Warsaw and Management Academy Warsaw Poland Software Engineering Department
Faculty of Automatics Computers and Electronics University of Craiova Bvd.Decebal Craiova Romania University of Duisburg-Essen
Institute for Computer Science and Business Information Systems (ICB) Practical Computer Science Data Management Systems and Knowledge Representation Essen Germany
Similarity estimation can be used in many applications such as recommender system, cluster analysis, information retrieval and link prediction. SimRank is a famous algorithm to measure objects' similarities based ...
详细信息
Federated policy systems are required to support the complexity and organizational heterogeneity of the modern marketplace. The Community-based Policy Management System (CBPMS) is such a distributed policy management ...
详细信息
Detecting events from web resources is a challenging task, attracting many attentions in recent years. Web search log is an important data source for event detection because the information it contains reflects users&...
详细信息
ISBN:
(纸本)9783642142451
Detecting events from web resources is a challenging task, attracting many attentions in recent years. Web search log is an important data source for event detection because the information it contains reflects users' activities and interestingness to various real world events. There are three major issues for event detection from web search logs: effectiveness, efficiency and the organization of detected events. In this paper, we develop a novel Topic and Event Detection method, TED, to address these issues. We first divide the whole data into topics for efficiency consideration, and then incorporate link information, temporal information and query content to ensure the quality of detected events. Finally, events detected are organized through the proposed interestingness measure as well as topics they belong to. Experiments are conducted on a commercial search engine log. The results demonstrate that our method can effectively and efficiently detect hot events and give a meaningful organization of them.
SimRank is a well known algorithm which conducts link analysis to measure similarity between each pair of nodes (nodepair). But it suffers from high computational cost, limiting its usage in large-scale datasets. More...
详细信息
This paper presents two real-world case studies focussing on descriptive data mining for decision-makers. For that, we first propose a process-oriented design of descriptive data mining that helps in describing and pe...
详细信息
This paper presents two real-world case studies focussing on descriptive data mining for decision-makers. For that, we first propose a process-oriented design of descriptive data mining that helps in describing and performing such projects. Finally, we discuss important lessons learned during the implementation of the respective projects.
Traffic congestion is a very serious problem in large cities. With the number of vehicles increasing rapidly, especially in cities whose economy is booming, the situation is getting even worse. In this paper, by lever...
详细信息
Recently there has been a lot of interest in graph-based analysis. One of the most important aspects of graph-based analysis is to measure similarity between nodes in a graph. SimRank is a simple and influential measu...
详细信息
The scaffolding of a complete lattice L of finite length was introduced by Rudolf Wille in 1976 as a relative subsemilattice of L that can be constructed using subdirect decomposition. The lattice is uniquely defined ...
详细信息
The scaffolding of a complete lattice L of finite length was introduced by Rudolf Wille in 1976 as a relative subsemilattice of L that can be constructed using subdirect decomposition. The lattice is uniquely defined by its scaffolding and can be reconstructed from it. Using bonds, we demonstrate how the scaffolding can be constructed from a given formal context and thereby extend the notion of the scaffolding to doubly founded lattices. Further, we explain the creation of a suitable graphical representation of the scaffolding from the context.
暂无评论