IR @ Goa University

Browsing Goa Business School by Author "Naik, S.B."

Browsing Goa Business School by Author "Naik, S.B."

Sort by: Order: Results:

  • Naik, S.B.; Pawar, J.D. (International Conference on Computing, Communication and Automation (ICCCA), 5-6 May 2017. 2017; 58-62.)
    Millions of users create user profiles on social media. Changes made to an attribute in the user profiles on social media generate a huge volume of data representing a data stream. A framework has been proposed to analyze ...
  • Naik, S.B.; Pawar, J.D. (19. Int. Conf. on Management of Data (COMAD). 2013; 117-120.)
    The purpose of this work is to mine closed frequent itemsets from transactional data streams using a sliding window model. An efficient algorithm IMCFI is proposed for <u>I</u>ncremental <u>M</u>ining of <u>C</u>losed ...
  • Paul, D.V.; Naik, S.B.; Pawar, J.D. (International Journal of ICT Research and Development in Africa. 4(1); 2014; 61-75.)
    The success of any educational program depends on its evaluation system. Examinations are a part of learning process which acts as an element in evaluation. For the smooth conduct of examinations of various universities ...
  • Paul, D.V.; Naik, S.B.; Pawar, J.D. (Nat. Conf. on e-Learning and e-Learning Technologies. ELELTECH INDIA-2013. 2013; 47-53.)
    Question selection plays a key role in question paper generation systems. Also it is the most significant and time consuming activity. The question selection is handled in traditional question paper generation systems by ...
  • Naik, S.B.; Pawar, J.D. (Advances in Intelligent Systems and Computing. Springer, Singapore. 828; 2018; 357-365.)
    We have presented an approach that generates frequent itemsets from data stream. The itemsets are compressed and then stored in the memory. The decision to whether or not compress an itemset is based on the utility of the ...
  • Naik, S.B.; Pawar, J.D. (International Conference on Computational Intelligence in Data Science (ICCIDS), 2-3 Jun 2017. 2017; 6pp.)
    In this paper we propose a framework and approach to model events as elements of data stream and perform analysis to group values of attribute similar to each other within an attribute and find associations between clusters ...
  • Naik, S.B.; Pawar, J.D. (Proc. 2. ACM IKDD Conference on Data Sciences (CoDS '15). ACM. 2015; 126-127.)
    An efficient algorithm QMINE to find closed frequent itemsets over a data stream is proposed. Our approach performs a few operations. Experiments have shown that our approach outperforms the previous approaches, significantly.
  • Naik, S.B.; Pawar, J.D. (Int. Conf. on Intelligent Computing, Instrumentation and Control Technologies, ICICICT-2017. 2018; 565-569.)
    Finding frequent itemsets from transactional data streams is a challenging task due to the large volumes of data in the data stream. It is not feasible to store all the elements of the data stream at once in the memory for ...
  • Paul, D.V.; Naik, S.B.; Rane, P.; Pawar, J.D. (Proc. IEEE 4th Int. Conf. on Technology for Education (T4E). 18-20 Jul 2012. 2012; 144-148.)
    This paper focuses on question paper template generation and its use in dynamic generation of examination question paper. Question paper template generation is a constrained based optimization problem. Choosing an efficient, ...

Search IR


Advanced Search

Browse

My Account