Along with the development of Internet and Web2.0, online social networks (OSNs) are becoming an important information propagation platform. Therefore, it is of great significance to study the information propagation ...
详细信息
In this paper, the author defines Generalized Unique Game Problem (GUGP), where weights of the edges are allowed to be negative. Two special types of GUGP are illuminated, GUGP-NWA, where the weights of all edges are ...
详细信息
As the sharable and reusable domain knowledge, domain ontology increasingly serves as a foundation for semantic Web. Personalized management of domain ontologies is to provide personalized views of domain ontologies t...
详细信息
As the sharable and reusable domain knowledge, domain ontology increasingly serves as a foundation for semantic Web. Personalized management of domain ontologies is to provide personalized views of domain ontologies to users during run time according to user preferences. It helps that users can focus on their interested parts, instead of the whole. It increases the efficiency of ontology-based application. This paper proposes a framework for personalized management of domain ontologies. In this framework, a user model firstly is introduced to describe user preferences. Secondly, domain ontologies are decomposed into moderate-scale modules with high cohesion and low coupling. During run time, modules that a user is interested in are selected out based on the user's preferences. Finally, the selected modules are combined to construct personalized views of domain ontologies for the user.
In this paper, we study how to perform XML query expansion effectively from the high quality pseudo-relevance documents. A solution for selecting good expansion information is presented, in which various features impa...
详细信息
In this paper, we study how to perform XML query expansion effectively from the high quality pseudo-relevance documents. A solution for selecting good expansion information is presented, in which various features impacting weight, such as term element frequency, term inverse element frequency, semantic weight of tag and level information, are analyzed and those term with high weigh value are selected as expansion term. Experiment results show that proposed expansion method is feasible. Compared to original query and traditional expansion method with no structure features considered, our method achieves better retrieval performance.
Given a multi-features data set, a best preference query (BPQ) computes the maximal preference score (MPS) that the tuples in the data set can achieve with respect to a preference function. BPQs are very useful in app...
详细信息
Currently, most works on interval valued problems mainly focus on attribute reduction (i.e., feature selection) by using rough set technologies. However, less research work on classifier building on interval-valued pr...
详细信息
Currently, most works on interval valued problems mainly focus on attribute reduction (i.e., feature selection) by using rough set technologies. However, less research work on classifier building on interval-valued problems has been conducted. It is promising to propose an approach to build classifier for interval-valued problems. In this paper, we propose a classification approach based on interval valued fuzzy rough sets. First, the concept of interval valued fuzzy granules are proposed, which is the crucial notion to build the reduction framework for the interval-valued databases. Second, the idea to keep the critical value invariant before and after reduction is selected. Third, the structure of reduction rule is completely studied by using the discernibility vector approach. After the description of rule inference system, a set of rules covering all the objects can be obtained, which is used as a rule based classifier for future classification. Finally, numerical examples are presented to illustrate feasibility and affectivity of the proposed method in the application of privacy protection.
this paper,the author defines Generalized Unique Game Problem (GUGP),where weights of the edges are allowed to be *** special types of GUGP are illuminated,GUGP-NWA,where the weights of all edges are negative,and GUGP...
this paper,the author defines Generalized Unique Game Problem (GUGP),where weights of the edges are allowed to be *** special types of GUGP are illuminated,GUGP-NWA,where the weights of all edges are negative,and GUGP-PWT(ρ),where the total weight of all edges are positive and the negative-positive ratio is at most ρ.
With the increasing of XML data over the Internet, managing and analyzing huge amount of XML documents has played an important role for information management. Clustering as an intelligent technique has been utilized ...
详细信息
With the increasing of XML data over the Internet, managing and analyzing huge amount of XML documents has played an important role for information management. Clustering as an intelligent technique has been utilized as an excellent way of grouping the documents by their content or structure. However, the key problem is how to measure similarity between XML documents. In this paper, we propose an extended vector space model and on this basis put forward an effective semantic similarity measurement method combining content and structure semantics, in which a variety of XML document features impacting similarity measurement, such as term element frequency, term inverse element frequency, semantic weight of tag and level information of the term, are analyzed. In addition, information gain, for clustering quality evaluation are introduced motivated by the fact that collection has no classification information in advance. Experiment results show that proposed similarity method (EVSM_SS) outperforms the content and structure integration measurement based on structure path (VSM_SP) as well as traditional document clustering measurement (CO) in information gain and produce better clustering quality.
The biggest characteristic of the XML retrieval is able to return the element node results. This paper studies XML element search results clustering and proposes one similarity measurement method based on term semanti...
详细信息
The biggest characteristic of the XML retrieval is able to return the element node results. This paper studies XML element search results clustering and proposes one similarity measurement method based on term semantics, in which the "core" concept between terms is got through latent semantic indexing technology(LSI) and the same time the XML element node content and semantic structure properties(CASS) are combined. In addition, two new performance evaluation methodologies, namely R_ClusterRatio and R_DocuRatio are introduced to evaluate clustering quality. It is motivated by the observations of relevant documents distribution and the fact that the experiment data collection, IEEE CS corpus, do not provide classification information. Experiment results show that proposed similarity method combining term semantics with content and structure semantics integration(LSI-CASS) is feasible, and it produces better clustering quality than LSI-CAS and CASS.
Although there exist a few good schemes to protect the kernel hooks of operating systems, attackers are still able to circumvent existing defense mechanisms with spurious context infonmtion. To address this challenge,...
详细信息
Although there exist a few good schemes to protect the kernel hooks of operating systems, attackers are still able to circumvent existing defense mechanisms with spurious context infonmtion. To address this challenge, this paper proposes a framework, called HooklMA, to detect compromised kernel hooks by using hardware debugging features. The key contribution of the work is that context information is captured from hardware instead of from relatively vulnerable kernel data. Using commodity hardware, a proof-of-concept pro- totype system of HooklMA has been developed. This prototype handles 3 082 dynamic control-flow transfers with related hooks in the kernel space. Experiments show that HooklMA is capable of detecting compomised kernel hooks caused by kernel rootkits. Performance evaluations with UnixBench indicate that runtirre overhead introduced by HooklMA is about 21.5%.
暂无评论