Older blog entries for sness (starting at number 5812)

weka - Making predictions

weka - Making predictions: "Classifiers
After a model has been saved, one can make predictions for a test set, whether that set contains valid class values or not. The output will contain both the actual and predicted class. (Note that if the test class contains simply '?' for the class label for each instance, the "actual" class label for each instance will not contain useful information, but the predicted class label will.) The "-T " command-line switch specifies the dataset of instances whose classes are to be predicted, while the "-p " switch allows the user to write out a range of attributes (examples: "1-2" for the first and second attributes, or "0" for no attributes). Sample command line:

java weka.classifiers.trees.J48 -T unclassified.arff -l j48.model -p 0"

'via Blog this'

Syndicated 2013-09-24 18:54:00 from sness

weka - Making predictions

weka - Making predictions: "java weka.classifiers.trees.J48 -T unclassified.arff -l j48.model -p 0"

'via Blog this'

Syndicated 2013-09-24 18:54:00 from sness

weka - Saving and loading models

weka - Saving and loading models: "You save a trained classifier with the -d option (dumping), e.g.:
java weka.classifiers.trees.J48 -t /some/where/train.arff -d /other/place/j48.model
And you can load it with -l and use it on a test set, e.g.:
java weka.classifiers.trees.J48 -l /other/place/j48.model -T /some/where/test.arff"

'via Blog this'

Syndicated 2013-09-24 18:53:00 from sness

Mark Whittle: Big Bang Acoustics

Mark Whittle: Big Bang Acoustics: "It's quite a shock to find out that the sound spectrum of the early Universe is a bit like a vibrating object – it has a fundamental with harmonics!"

Syndicated 2013-09-23 23:37:00 from sness

Sif - Wikipedia, the free encyclopedia

Sif - Wikipedia, the free encyclopedia: "In Norse mythology, Sif is a goddess associated with earth. Sif is attested in the Poetic Edda, "

'via Blog this'

Syndicated 2013-09-23 04:04:00 from sness

search - Ukkonen's suffix tree algorithm in plain English? - Stack Overflow

search - Ukkonen's suffix tree algorithm in plain English? - Stack Overflow: "The algorithm works in steps, from left to right. There is one step for every character of the string. Each step might involve more than one individual operation, but we will see (see the final observations at the end) that the total number of operations is O(n)."

'via Blog this'

Syndicated 2013-09-20 16:52:00 from sness




using ascii art in sublimetext. would be easy in emacs.

Syndicated 2013-09-20 16:51:00 from sness

▶ Burning Man 2013 Time-Lapse: Seen Miles Away From A Mountain Top - YouTube

▶ Burning Man 2013 Time-Lapse: Seen Miles Away From A Mountain Top - YouTube: "