Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
bob.learn.boosting
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Model registry
Operate
Environments
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
bob
bob.learn.boosting
Commits
bbed2538
Commit
bbed2538
authored
11 years ago
by
Rakesh MEHTA
Browse files
Options
Downloads
Patches
Plain Diff
comments added
parent
d2484d4e
Branches
Branches containing commit
Tags
Tags containing commit
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
README.rst
+14
-10
14 additions, 10 deletions
README.rst
with
14 additions
and
10 deletions
README.rst
+
14
−
10
View file @
bbed2538
...
@@ -14,17 +14,18 @@ The weak classfiers associated with these boosting algorithms are
...
@@ -14,17 +14,18 @@ The weak classfiers associated with these boosting algorithms are
Check the following reference for the details:
Check the following reference for the details:
1
)
Viola, Paul, and Michael J. Jones. "Robust real-time face detection."
1
.
Viola, Paul, and Michael J. Jones. "Robust real-time face detection."
International journal of computer vision 57.2 (2004): 137-154.
International journal of computer vision 57.2 (2004): 137-154.
2
)
Saberian, Mohammad J., Hamed Masnadi-Shirazi, and Nuno Vasconcelos. "Taylorboost:
2
.
Saberian, Mohammad J., Hamed Masnadi-Shirazi, and Nuno Vasconcelos. "Taylorboost:
First and second-order boosting algorithms with explicit margin control." Computer
First and second-order boosting algorithms with explicit margin control." Computer
Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on. IEEE, 2011.
Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on. IEEE, 2011.
3
)
Cosmin Atanasoaei, "Multivariate Boosting with Look Up Table for face processing",
3
.
Cosmin Atanasoaei, "Multivariate Boosting with Look Up Table for face processing",
PhD thesis (2012).
PhD thesis (2012).
Testdata:
Testdata:
----------
The test are performed on the MNIST digits dataset. The tests can be mainly divided into
The test are performed on the MNIST digits dataset. The tests can be mainly divided into
two categories:
two categories:
...
@@ -33,13 +34,16 @@ two categories:
...
@@ -33,13 +34,16 @@ two categories:
one-vs-one and one-vs-all. Both the boosting algorithm (Gradient Boost and Taylor boost)
one-vs-one and one-vs-all. Both the boosting algorithm (Gradient Boost and Taylor boost)
can be used for testing this scenario.
can be used for testing this scenario.
2) Multivariate Test: It is the multi class classification problem. All the 10 digit classfica
i
ton
2) Multivariate Test: It is the multi class classification problem. All the 10 digit classficat
i
on
is considered in a single test. Only Multivariate Taylor boosting can be used for testing this scenario.
is considered in a single test. Only Multivariate Taylor boosting can be used for testing this scenario.
Installation:
Installation:
----------
Once you have downloaded the package use the following two commands to install it:
Once you have downloaded the package use the following two commands to install it:
$ python bootstrap.py
$ python bootstrap.py
$ ./bin/buildout
$ ./bin/buildout
These 2 commands should download and install all non-installed dependencies and
These 2 commands should download and install all non-installed dependencies and
...
@@ -54,22 +58,22 @@ b) test the dataset for multi class classification.
...
@@ -54,22 +58,22 @@ b) test the dataset for multi class classification.
a) The following command will run a single binary test for the digits specified and display the classifcation
a) The following command will run a single binary test for the digits specified and display the classifcation
accuracy on the console:
accuracy on the console:
$ ./bin/mnist_binary_one.py
$ ./bin/mnist_binary_one.py
if you want to see all the option associated with the command type:
if you want to see all the option associated with the command type:
$ ./bin/mnist_binary_one.py -h
$ ./bin/mnist_binary_one.py -h
To run the tests for all the combination of of ten digits use the following command:
To run the tests for all the combination of of ten digits use the following command:
$ ./bin/mnist_binary_all.py
$ ./bin/mnist_binary_all.py
This command tests all the possible comniation of digits which results in 45 different binary tests. The
This command tests all the possible comniation of digits which results in 45 different binary tests. The
accuracy of individual tests and the final average accuracy of all the tests is displayed on the console.
accuracy of individual tests and the final average accuracy of all the tests is displayed on the console.
b) The following command can be used for the multivarite digits test:
b) The following command can be used for the multivarite digits test:
$ ./bin/mnist_multi.py
$ ./bin/mnist_multi.py
Because of large number of samples and multivariate problem it requires times in days on a normal system. Use -h
Because of large number of samples and multivariate problem it requires times in days on a normal system. Use -h
option to see different option available with this command.
option to see different option available with this command.
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment