Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  investigate the problem of learning a classification task for datasets which are described by matrices. Rows and columns of these matrices correspond to objects, where row and column objects may belong to different sets, and the entries in the matrix express the relationships beten them.  interpret the matrix elements as being produced by an unknown kernel which operates on object pairs and  show that - under mild assumptions - these kernels correspond to dot products in some (unknown) feature space. Minimizing a bound for the generalization error of a linear classifier which has been obtained using covering numbers  derive an objective function for model selection according to the principle of structural risk minimization. The new objective function has the advantage that it allows the analysis of matrices which are not positive definite, and not even symmetric or square.  then consider the case that row objects are interpreted as features.  suggest an additional constraint, which imposes sparseness on the row objects and show, that the method can then be used for feature selection. Finally,  apply this method to data obtained from DNA microar-rays, where "column" objects correspond to samples, "row" objects correspond to genes and matrix elements correspond to expression levels. Benchmarks are conducted using standard one-gene classification and support vector machines and K-nearest neighbors after standard feature selection. Our new method extracts a sparse set of genes and provides superior classification results.
['Sepp Hochreiter', 'Klaus Obermayer']
I am writing a research paper on a idea Feature Selection and Classification on Matrix Data: From Large Margins to Small Covering Numbers
[{"from": "human", "value": "I am writing a research paper on a idea Feature Selection and Classification on Matrix Data: From Large Margins to Small Covering Numbers"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  investigate the problem of learning a classification task for datasets which are described by matrices. Rows and columns of these matrices correspond to objects, where row and column objects may belong to different sets, and the entries in the matrix express the relationships beten them.  interpret the matrix elements as being produced by an unknown kernel which operates on object pairs and  show that - under mild assumptions - these kernels correspond to dot products in some (unknown) feature space. Minimizing a bound for the generalization error of a linear classifier which has been obtained using covering numbers  derive an objective function for model selection according to the principle of structural risk minimization. The new objective function has the advantage that it allows the analysis of matrices which are not positive definite, and not even symmetric or square.  then consider the case that row objects are interpreted as features.  suggest an additional constraint, which imposes sparseness on the row objects and show, that the method can then be used for feature selection. Finally,  apply this method to data obtained from DNA microar-rays, where \"column\" objects correspond to samples, \"row\" objects correspond to genes and matrix elements correspond to expression levels. Benchmarks are conducted using standard one-gene classification and support vector machines and K-nearest neighbors after standard feature selection. Our new method extracts a sparse set of genes and provides superior classification results."}]