Asian Science Citation Index is committed to provide an authoritative, trusted and significant information by the coverage of the most important and influential journals to meet the needs of the global scientific community.  
ASCI Database
308-Lasani Town,
Sargodha Road,
Faisalabad, Pakistan
Fax: +92-41-8815544
Contact Via Web
Suggest a Journal
 
Articles by R. Nadarajan
Total Records ( 3 ) for R. Nadarajan
  M. Thilagu and R. Nadarajan
  Frequent sequence mining has been a topic of research interest in recent years. Mining of web log sequence with forward references is an application of sequence mining and useful with many applications that include web recommendation, caching, pre-fetching etc. In this study, a fast algorithm presented that aims at mining prefix based maximal frequent contiguous sequences with priority in web logs efficiently. To enable fast mining, the algorithm first generates maximal potential patterns and discovers frequent patterns from them without candidate generation. Experimental results show that the proposed algorithm can perform better than existing approaches.
  R.M. Periakaruppan and R. Nadarajan
  Keyword based Information Retrieval (IR) Systems fails when there is no exact matching. Hence, IR Systems more focused on user relevant information retrieval. In this study, researchers proposed a technique to improve the searching based on Fuzzy set similarity measure, domain knowledge representation and semantics. In the proposed method, researchers extract candidate keywords from each document which reflects the topic of the document and map them with a suitable domain knowledge classification system. The mapping process associate a semantic weight to each keyword based on Latent Semantic Indexing (LSI) which reflects the significance of each keyword in the document with respect to a domain. As a result of mapping process the keywords along with their semantic weights are represented as XML document and they are clustered based on similarity measure. The experiments shows that the proposed similarity measure yields better results when compared with conventional similarity measure techniques.
  I. Elizabeth Shanthi and R. Nadarajan
  An important question in information retrieval is how to create a database index which can be searched efficiently for the data one seeks. One such technique called signature file based access method is preferred for its easy handling of insertion and update operations. Most of the proposed methods use either efficient search method or tree based intermediate data structure to filter data objects matching the query. Use of search techniques retrieves the objects by sequentially comparing the positions of 1s in it. Such methods take longer retrieval time. On the other hand tree based structures traverse multiple paths making comparison process tedious. This study describes a new indexing technique for object-oriented data bases using the dynamic balancing of B+ tree called SD (Signature Declustering) tree. The SD-tree represents all 1s in signatures in a compact manner that results in saving of insertion and searching time. Analytical experiments have been conducted by varying the signature length and the distribution of signature weight. The study clearly indicates the advantage of fast retrieval time in a way quite different from the other methods suggested in the past.
 
 
 
Copyright   |   Desclaimer   |    Privacy Policy   |   Browsers   |   Accessibility