Please use this identifier to cite or link to this item:
https://idr.l3.nitk.ac.in/jspui/handle/123456789/7087
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Deepak, A. | |
dc.contributor.author | Shravya, K.S. | |
dc.contributor.author | Chandrasekaran, K. | |
dc.date.accessioned | 2020-03-30T09:58:29Z | - |
dc.date.available | 2020-03-30T09:58:29Z | - |
dc.date.issued | 2016 | |
dc.identifier.citation | Proceedings of 2015 IEEE International Conference on Research in Computational Intelligence and Communication Networks, ICRCICN 2015, 2016, Vol., , pp.214-219 | en_US |
dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/7087 | - |
dc.description.abstract | In spite of presence of many classical and modified data analysis techniques, data analysis in the field of software engineering still remains a challenge because of the presence of large number of both continuous and discreet explanatory variables judging the outcome of one and more than one dependant variables. Requirement for an efficient multivariate data analysis technique which fulfils the constraints associated with software data led to the design of OSR (optimized set reduction) which uses a greedy algorithm for data analysis using both the principles of machine learning and conventional statistics. With the incoming of big data and other increasing dimensions of data set, we, through this paper, try to propose a new algorithm, based on the similar lines of optimised set reduction, using its strength to extract subsets. As the current trend of programming demands an algorithm to execute in parallel, we also propose a modification to our algorithm for it to run in a multicore platform with good efficiency. � 2015 IEEE. | en_US |
dc.title | A parallel dynamic programming approach for data analysis | en_US |
dc.type | Book chapter | en_US |
Appears in Collections: | 2. Conference Papers |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.