Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Computing Bayesian statistics with traditional techniques is extremely slow, specially when large data has to be exported from a relational DBMS.  propose algorithms for large scale processing of stochastic search variable selection (SSVS) for linear regression that can work entirely inside a DBMS. The traditional SSVS algorithm requires multiple scans of the input data in order to compute a regression model. Due to our optimizations, SSVS can be done in either one scan over the input table for large number of records with sufficient statistics, or one scan per iteration for high-dimensional data.  consider storage layouts which efficiently exploit DBMS parallel processing of aggregate functions. Experimental results demonstrate correctness, convergence and performance of our algorithms. Finally, the algorithms show good scalability for data with a very large number of records, or a very high number of dimensions.
['Mario Navas', 'Carlos Ordonez', 'Veerabhadran Baladandayuthapani']
I am writing a research paper on a idea On the Computation of Stochastic Search Variable Selection in Linear Regression with UDFs
[{"from": "human", "value": "I am writing a research paper on a idea On the Computation of Stochastic Search Variable Selection in Linear Regression with UDFs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Computing Bayesian statistics with traditional techniques is extremely slow, specially when large data has to be exported from a relational DBMS.  propose algorithms for large scale processing of stochastic search variable selection (SSVS) for linear regression that can work entirely inside a DBMS. The traditional SSVS algorithm requires multiple scans of the input data in order to compute a regression model. Due to our optimizations, SSVS can be done in either one scan over the input table for large number of records with sufficient statistics, or one scan per iteration for high-dimensional data.  consider storage layouts which efficiently exploit DBMS parallel processing of aggregate functions. Experimental results demonstrate correctness, convergence and performance of our algorithms. Finally, the algorithms show good scalability for data with a very large number of records, or a very high number of dimensions."}]