well guyz.. I have to implement an algorithm and it works as follows: we need to take some different sized data sets ( numerical) , which has some objects and attributes The algorithm first starts off with an empty set and it adds attributes thereafter The dependency of each attribute is calculated. It is given by dividing the absolute value of those attributes which are certainly contained in the universal set over the absolute value of all the attributes ( or the universal set ) in the data set taken Once the dependency is calculated for every attribute, the best candidate is chosen which has the highest dependency. Again the process is repeated and it continues until the dependency is equal to the consistency of the data set ( value = 1) Well.. this is how the algorithm works.. Can someone tell me about how to go about starting or implementing this ? (I'm new to the coding world.. so, if someone plz throw their ideas, ill be grateful) thx regards raj chopra
Sounds straight forward enough. How far have you got, and where are you stuck? If you post code, please use [ code ] and [ /code ] tags (without spaces) so that the code formatting is preserved. Your course should have covered how to start writing code and some of the data structures necessary to solve this; it would be a very poor course where they said "welcome to the Java programming course, here's your first task and now I'm off for a coffee".
