Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
14
views
13
references
Top references
cited by
0
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
823
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Machine Learning and Knowledge Discovery in Databases
The Bitvector Machine: A Fast and Robust Machine Learning Algorithm for Non-linear Problems
other
Author(s):
Stefan Edelkamp
,
Martin Stommel
Publication date
(Print):
2012
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Annual Reviews AI, Machine Learning, and Society
Most cited references
13
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Object recognition from local scale-invariant features
D.G. Lowe
(1999)
0
comments
Cited
904
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Multidimensional binary search trees used for associative searching
Jon Louis Bentley
(1975)
0
comments
Cited
681
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
On the Surprising Behavior of Distance Metrics in High Dimensional Space
Charu C. Aggarwal
,
Alexander Hinneburg
,
Daniel Keim
(2001)
0
comments
Cited
160
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2012
Pages
: 175-190
DOI:
10.1007/978-3-642-33460-3_17
SO-VID:
563daa82-8146-4046-aa91-e2e0361802c3
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Machine Learning for Robotics
pp. 2
Declarative Modeling for Machine Learning and Data Mining
pp. 4
Machine Learning Methods for Music Discovery and Recommendation
pp. 5
Solving Problems with Visual Analytics: Challenges and Applications
pp. 7
Analyzing Text and Social Network Data with Probabilistic Models
pp. 9
Discovering Descriptive Tile Trees
pp. 25
Efficient Discovery of Association Rules and Frequent Itemsets through Sampling with Tight Performance Guarantees
pp. 42
Smoothing Categorical Data
pp. 58
An Experimental Comparison of Hybrid Algorithms for Bayesian Network Structure Learning
pp. 74
Bayesian Network Classifiers with Reduced Precision Parameters
pp. 90
Combining Subjective Probabilities and Data in Training Markov Logic Networks
pp. 106
Score-Based Bayesian Skill Learning
pp. 122
A Note on Extending Generalization Bounds for Binary Large-Margin Classifiers to Multiple Classes
pp. 130
Extension of the Rocchio Classification Method to Multi-modal Categorization of Documents in Social Media
pp. 143
Label-Noise Robust Logistic Regression and Its Applications
pp. 159
Sentiment Classification with Supervised Sequence Embedding
pp. 175
The Bitvector Machine: A Fast and Robust Machine Learning Algorithm for Non-linear Problems
pp. 191
Embedding Monte Carlo Search of Features in Tree-Based Ensemble Methods
pp. 207
Hypergraph Spectra for Semi-supervised Feature Selection
pp. 223
Learning Neighborhoods for Metric Learning
pp. 237
Massively Parallel Feature Selection: An Approach Based on Variance Preservation
pp. 253
PCA, Eigenvector Localization and Clustering for Side-Channel Attacks on Cryptographic Hardware Devices
pp. 269
Classifying Stem Cell Differentiation Images by Information Distance
pp. 283
Distance Metric Learning Revisited
pp. 299
Geodesic Analysis on the Gaussian RKHS Hypersphere
pp. 314
Boosting Nearest Neighbors for the Efficient Estimation of Posteriors
pp. 330
Diversity Regularized Ensemble Pruning
pp. 346
Ensembles on Random Patches
pp. 362
An Efficiently Computable Support Measure for Frequent Subgraph Pattern Mining
pp. 394
Graph Mining for Object Tracking in Videos
pp. 410
Hypergraph Learning with Hyperedge Expansion
pp. 426
Nearly Exact Mining of Frequent Trees in Large Networks
pp. 442
Reachability Analysis and Modeling of Dynamic Event Networks
pp. 458
CC-MR – Finding Connected Components in Huge Graphs with MapReduce
pp. 474
Fast Near Neighbor Search in High-Dimensional Binary Data
pp. 490
Fully Sparse Topic Models
pp. 506
Learning Compact Class Codes for Fast Inference in Large Multi Class Classification
pp. 537
Stochastic Coordinate Descent Methods for Regularized Smooth and Nonsmooth Losses
pp. 553
Sublinear Algorithms for Penalized Logistic Regression in Massive Datasets
pp. 569
Author Name Disambiguation Using a New Categorical Distribution Similarity
pp. 585
Lifted Online Training of Relational Models with Stochastic Gradient Methods
pp. 601
Scalable Relation Prediction Exploiting Both Intrarelational Correlation and Contextual Information
pp. 633
Efficient Training of Graph-Regularized Multitask SVMs
pp. 648
Geometry Preserving Multi-task Metric Learning
pp. 665
Learning and Inference in Probabilistic Classifier Chains with Beam Search
pp. 681
Learning Multiple Tasks with Boosted Decision Trees
pp. 697
Multi-Task Boosting by Exploiting Task Relationships
pp. 711
Sparse Gaussian Processes for Multi-task Learning
pp. 728
Collective Information Extraction with Context-Specific Consistencies
pp. 744
Supervised Learning of Semantic Relatedness
pp. 760
Unsupervised Bayesian Part of Speech Inference with Particle Gibbs
pp. 774
WikiSent: Weakly Supervised Sentiment Analysis through Extractive Summarization with Wikipedia
pp. 794
Adaptive Two-View Online Learning for Math Topic Classification
pp. 810
BDUOL: Double Updating Online Learning on a Fixed Budget
pp. 827
Handling Time Changing Data with Adaptive Very Fast Decision Rules
pp. 843
Improved Counter Based Algorithms for Frequent Pairs Mining in Transactional Data Streams
pp. 859
Mirror Descent for Metric Learning: A Unified Approach
Similar content
823
Feature Selection based nature inspired Capuchin Search Algorithm for solving classification problems
Authors:
Malik Braik
,
Abdelaziz Hammouri
,
Hussein Alzoubi
…
Color intensity projections provides a fast, simple and robust method of summarizing the grayscale images from a renal scan in a single color image
Authors:
Keith Cover
Nature-inspired optimization algorithms: Challenges and open problems
Authors:
Xin-She Yang
See all similar