IR @ Goa University

Browsing Business, Commerce, Economics & Computer Sciences by Author "Rao, P.R."

Browsing Business, Commerce, Economics & Computer Sciences by Author "Rao, P.R."

Sort by: Order: Results:

  • An attribute based storage method for speeding up CLIQUE algorithm for subspace clustering 
    Pawar, J.D.; Rao, P.R. (Proc. of the International Database Engineering and Applications Symposium (IDEAS). 11-14 Dec 2006. 2006; 309-310.)
    The subspace clustering algorithm CLIQUE finds all subspace clusters including overlapping clusters existing in high dimensional datasets. CLIQUE consists of three main steps namely - (1) identification of subspaces that ...
  • Capturing association among items in a database 
    Adhikari, A.; Rao, P.R. (Data and Knowledge Engineering. 67(3); 2008; 430-443.)
    Measuring association among variables is an important step for finding solutions to many data mining problems. An existing metric might not be effective to serve as a measure of association among a set of items in a database. ...
  • Central partition for a partition-distance and strong pattern graph 
    Pinto Da Costa, J.F.; Rao, P.R. (Revstat: Statistical Journal. 2(2); 2004; 127-143.)
    When several clustering algorithms are applied to a dataset E or the same algorithm with different parameters, we get several different partitions of the dataset. In this paper we consider the problem of finding a consensus ...
  • Data caching issues in client/ server database systems 
    Pinto, Y.; Rao, P.R. (Journal of the CSI. 30(1); 2000; 18-24)
    With Client/Server Systems becoming the defacto in many dispersed organizations, the current focus in research should also be on improving performance in such systems. The key to performance and scalability of Client/Server ...
  • Design and analysis of Subspace Clustering Algorithms and Their Applicability 
    Pawar, J.D.
  • Detecting cliques using degree and connectivity constraints 
    Bhamaikar, A.A.; Rao, P.R. (International Journal of Data Mining and Knowledge Management Process. 2; 2012; 39-46.)
    In graph mining determining clique is np complete problem. This paper introduces pruning strategies, by which linear time algorithm for detecting clique is obtained. Clique determination is widely applicable in social ...
  • Detecting monotonic graph over edge connectivity constraint 
    Bhamaikar, A.A.; Rao, P.R. (International Journal of Innovative Technology and Creative Engineering. 1; 2011; 1-5.)
    Edge Connectivity parameter of a given graph is widely used in graph mining and finds usage in wide range of applications like transportation problem , Microarray Data , Bioinformatics etc. Based upon the property of a ...
  • Efficient clustering of databases induced by local patterns 
    Adhikari, A.; Rao, P.R. (Decision Support Systems. 44(4); 2008; 925-943.)
    Many large organizations have multiple large databases as they transact from multiple branches. Most of the previous pieces of work are based on a single database. Thus, it is necessary to study data mining on multiple ...
  • Enhancing quality of knowledge synthesized from multi-database mining 
    Adhikari, A.; Rao, P.R. (Pattern Recognition Letters. 28(16); 2007; 2312-2324.)
    Multi-database mining using local pattern analysis could be considered as an approximate method of mining multiple large databases. Thus, it might be required to enhance the quality of knowledge synthesized from multiple ...
  • Errors of supervised classification Techniques on real world problems 
    Kumar, J.A.; Rao, P.R. (Journal of Global Research in Computer Science. 1; 2010; 1-6.)
    In supervised learning, classifiers are trained with data consisting class labels to solve real-world classification problems. Decision trees, random forest, naïve Bayes, Bayesian networks, K- Nearest neighbourhood logistic ...
  • Identifying calendar based periodic patterns 
    Adhikari, J.; Rao, P.R. (Emerging Paradigms in Machine Learning, Ed. By: S. Ramanna, L.C. Jain and R.J. Howlett, Springer-Verlag Berlin Heidelberg. 2013; 329-357.)
    A large class of problems deals with temporal data. Identifying temporal patterns in these datasets is a natural as well as an important task. In the recent time, researchers have reported an algorithm for finding ...
  • Knowledge Discovery in Databases with an Emphasis on Multiple Large Databases 
    Adhikari, Animesh
  • Measuring influence of an item in a database over time 
    Adhikari, J.; Rao, P.R. (Pattern Recognition Letters. 31(3); 2010; 179-187.)
    Influence of items on some other items might not be the same as the association between these sets of items. Many tasks of data analysis are based on expressing influence of items on other items. In this paper, we introduce ...
  • Mining and Analysis of Time-stamped Databases 
    Adhikari, J.
  • Mining conditional patterns in a database 
    Adhikari, A.; Rao, P.R. (Pattern Recognition Letters. 29(10); 2008; 1515-1523.)
    Though frequent itemsets and association rules express interesting association among items of frequently occurring itemsets in a database, there may exist other types of interesting associations among the items. A critical ...
  • Mining important sub-graphs using skyline approach over vertex connectivity constraint 
    Bhamaikar, A.A.; Rao, P.R. (CiiT International Journal of Data Mining Knowledge Engineering. 5; 2012; 220-225.)
    Mining of Sub-Graphs having highest value over vertex connectivity and Degree constraint plays a major role in Applications such as Social Network Analysis, Bioinformatics, Mobile Communications and Transportation Problems. ...
  • Mining multiple large data sources 
    Adhikari, A.; Rao, P.R.; BhanuPrasad; Adhikari, J. (International Arab Journal of Information Technology (IAJIT). 7(3); 2010; 241-249.)
    Effective data analysis using multiple databases requires highly accurate patterns. Local pattern analysis might extract low quality patterns from multiple large databases. Thus, it is necessary to improve mining multiple ...
  • Study of select items in different data sources by grouping 
    Adhikari, A.; Rao, P.R.; Pedrycz, W. (Knowledge and Information Systems. 27(1); 2011; 23-43.)
    Many large organizations have multiple large databases as they transact from multiple branches. Many important decisions are based on a set of specific items called the select items. Thus, the analysis of select items in ...
  • Synthesizing heavy association rules from different real data sources 
    Adhikari, A.; Rao, P.R. (Pattern Recognition Letters. 29(1); 2008; 59-71.)
    Many large organizations have multiple databases distributed over different branches. Number of such organizations is increasing over time. Thus, it is necessary to study data mining on multiple databases. In this paper ...

Search IR


Advanced Search

Browse

My Account