Browsing projects by Tag(s)

Select a tag to browse associated projects and drill deeper into the tag cloud.

Showing page 1 of 1

Indus Learning Framework(ILF)The indus learning framework is a suite of machine learning algorithms that learn from datasets using sufficient statistics. This framework is particularly useful in the following scenarios: When the data set is huge and the it cannot be fit into memory (e.g arff ... [More] file is huge and weka runs out of memory) When access to underlying data instances is not available (due to considerations such as security or cost) but the datasources provides some statistics (like count queries) The current implementation of the framework provides Naive Bayes and Decison Trees. The framework has been written so that it can be extended to include more classifiers that are amenable to the sufficient statistics approach. Refer the user's guide wiki for how to run the various classifiers in the framework. Besides being run from command line the ILF allows provides API which can be used to integrated into a target application. Integration Samplessample 1import airldm2.core.datatypes.relational.SingleRelationDataDescriptor; import airldm2.core.datatypes.relational.RelationalDataSource; import airldm2.util.SimpleArffFileReader; import airldm2.classifiers.Evaluation import weka.classifiers.evaluation.ConfusionMatrix; import weka.core.Utils; ........ ....... String[] options= {"-b", "-trainTable", "votes_train", "-testFile","sample/HouseVotesTrain.arff"}; String trainTableName = Utils.getOption("trainTable", options); String testFile = Utils.getOption("testFile", options); NaiveBayesClassifier classifier = new NaiveBayesClassifier(); SingleRelationDataDescriptor desc = null; SimpleArffFileReader readTest = new SimpleArffFileReader(testFile); LDTestInstances testInst = readTest.getTestInstances(); desc = (SingleRelationDataDescriptor )testInst.getDesc(); SSDataSource dataSource = new RelationalDataSource(trainTableName); // Create a Large DataSet Instance and set its descriptor and source LDInstances trainData = new LDInstances(); trainData.setDesc(desc); trainData.setDataSource(dataSource); ConfusionMatrix matrix = Evaluation.evlauateModel2(classifier, trainData, testInst, options); System.out.println(matrix.toString("===Confusion Matrix===")); Extension With Indus Integration FrameworkThe system can use a data integration system to be able to learn from multiple disparate data sources. The current implementation has been extended to use Indus Integration Framework. User's are referred to the code and an example included in the source tree induse_extension_src For feature requests contact neeraj.kaul@gmail.com [Less]

0
 
  0 reviews  |  0 users  |  187,518 lines of code  |  2 current contributors  |  Analyzed 5 days ago
 
 

An implementation of CNN and PNN prototype reduction schemes using Java, targeting large data sets, as suggested on "Enhancing Protorype Reduction Schemes With Recursion: A Method Applicable for "Large" Data Sets" by Sang-Woon Kim and B. John Oommen.

0
 
  0 reviews  |  0 users  |  1,069 lines of code  |  0 current contributors  |  Analyzed about 13 hours ago
 
 

The Skip Trees is engineered by tailoring existing data structures i.e. 2-3 trees and Skiplists. Skip Trees (Fig 1) are explained using Pugh’s SkipList and 2-3 trees in this document. Each node in a SkipList points to the root of a 2-3 tree.2-3 Trees can be considered as a data elements in ... [More] SkipList. So SkipTree is a SkipList made out of 2-3 Trees. Skip Tree is designed by keeping in mind larger data sets. Data Set can range from 220 elements (with or without grouping). It can also be used for smaller Data sets. [Less]

0
 
  0 reviews  |  0 users  |  0 current contributors  |  Analyzed 3 days ago
 
 
 
 

Creative Commons License Copyright © 2013 Black Duck Software, Inc. and its contributors, Some Rights Reserved. Unless otherwise marked, this work is licensed under a Creative Commons Attribution 3.0 Unported License . Ohloh ® and the Ohloh logo are trademarks of Black Duck Software, Inc. in the United States and/or other jurisdictions. All other trademarks are the property of their respective holders.