Current systems for similarity-based virtual screening use similarity measures in which all the fragments in a fingerprint contribute equally to the calculation of structural similarity. This paper discusses the weighting of fragments on the basis of their frequencies of occurrence in molecules. Extensive experiments with sets of active molecules from the MDL Drug Data Report and the World of M...

Conventionally, pathway-based analysis assumes that genes in a pathway equally contribute to a biological function, thus assigning uniform weight to genes. However, this assumption has been proved incorrect, and applying uniform weight in the pathway analysis may not be an appropriate approach for the tasks like molecular classification of diseases, as genes in a functional group may have diffe...

Biometric is a technology for verification or identification of individuals by employing a person’s physiological and behavioural traits. Although these systems are more secured compared the traditional methods such as key, smart card or password, they also undergo with many limitations such as noise in sensed data, intra-class variations and spoof attacks. One of the solutions to these problem...

For a graph G(V,E) and a vertex s ∈ V , a weighting scheme (w : E → N) is called a min-unique (resp. max-unique) weighting scheme, if for any vertex v of the graph G, there is a unique path of minimum(resp. maximum) weight1 from s to v. Instead, if the number of paths of minimum(resp. maximum) weight is bounded by n for some constant c, then the weighting scheme is called a min-poly (resp. max-...

A well-known challenge of information retrieval is how to infer a user’s underlying information need when the input query consists of only a few keywords. Question Answering (QA) systems face an equally important but opposite challenge: given a verbose question, how can the system infer the relative importance of terms in order to differentiate the core information need from supporting context?...

3.1 Vector M odel ............................................................................................. 4 3.2 Terms W eighting ....................................................................................... 4 3.3 Similarity M easuring ................................................................................. 5 4 Improving kNN Performance using Different Term Weighting Sch...

For a graph G(V,E) (|V | = n) and a vertex s ∈ V , a weighting scheme (w : E → N) is called a min-unique (resp. max-unique) weighting scheme, if for any vertex v of the graph G, there is a unique path of minimum (resp. maximum) weight from s to v. Instead, if the number of paths of minimum (resp. maximum) weight is bounded by n for some constant c, then the weighting scheme is called a min-poly...

1 An analytical evaluation of six widely used term weighting techniques for text cate2 gorization is presented. The analysis depends on expressing the term weights using term 3 occurrence probabilities in positive and negative categories. The weighting behaviors of 4 the schemes considered are firstly clarified by analyzing the relation between the occur5 rence probabilities of terms which rece...