This paper presents a new taxonomy of sublinear (multiple) keyword pattern matching algorithms. Based on an earlier taxonomy by Watson and Zwaan [WZ96, WZ95], this new taxonomy includes not only suffix-based algorithms related to the Boyer-Moore, CommentzWalter and Fan-Su algorithms, but factorand factor oracle-based algorithms such as Backward DAWG Matching and Backward Oracle Matching as well...

Obtaining a useful complete overview of Web-based product information has become difficult nowadays due to the ever-growing amount of information available on online shops. Findings from previous studies suggest that better search capabilities, such as the exploitation of annotated data, are needed to keep online shopping transparent for the user. Annotations can, for example, help present info...

A taxonomy organizes concepts or topics in a hierarchical structure and can be created manually or via automated systems. One major drawback of taxonomies is that they require users to have the same view of the topics as the taxonomy creator. That is, when a user follows a top-down path to find the specific topic of her interest, she has to make choices along the constrained sequence that is pr...

We present a method for mapping a structure to a related taxonomy in a thematically consistent way. The components of the structure are supplied with fuzzy profiles over the taxonomy. These are then generalized in two steps: first, by fuzzy clustering, and then by mapping the clusters to higher ranks of the taxonomy. To be specific, we concentrate on the Computer Sciences area represented by th...

Malware has emerged as a cyber security threat that continuously changes to target computer systems, smart devices, and extensive networks with the development of information technologies. As result, malware detection always been major worry difficult issue, owing shortcomings in performance accuracy, analysis type, approaches fail identify unexpected attacks. This paper seeks conduct thorough ...

In this paper, we investigate a principled approach for defining and discovering probabilistic mappings between two taxonomies. First, we compare two ways of modeling probabilistic mappings which are compatible with the logical constraints declared in each taxonomy. Then we describe a generate and test algorithm which minimizes the number of calls to the probability estimator for determining th...

We propose an algorithm that divides a graph, whose vertices are users and whose edges represent shared interests, into subgraphs communities of interests (COIs). Our algorithm differs from conventional modularity-based community extraction because it introduces a mechanism to harmonize the number of users in each COI. It also attaches semantic tags to the relationships between COIs or between ...

nowadays, liveliness and rapid maintenance of the development process of the companies are dependent on the accurate and complete understanding of the merits of the financial activities. since these merits are relative concepts that are based on comparisons, lists of ranking and comparison of industries with each other act as useful signposts for managers, politicians, and investors. the point ...