Dontopedia

Linear Support Vector Machine

From Dontopedia, the open, paraconsistent wiki. (Last updated 2026-06-09.)

Linked via sameAs to 1 other subject: SvmReview & merge →

Linear Support Vector Machine has 24 facts recorded in Dontopedia across 2 references, with 1 live disagreement.

24 facts·22 predicates·2 sources·1 in dispute

Mostly:rdf:type(2), alias(1), training speed(1)

Maturity scale raw canonical shape-checked rule-derived certified

Inbound mentions (11)

Other subjects in dontopedia point AT this entity as a value. These are inverse relationships — e.g. "X motherOf this subject" — and answer questions the forward facts can't. Grouped by predicate.

memberMember(3)

comparedWithCompared With(1)

consistsOfConsists of(1)

demonstratesDemonstrates(1)

has-memberHas Member(1)

includesIncludes(1)

mentionedBeforeMentioned Before(1)

mentionsModelMentions Model(1)

relatesToRelates to(1)

Other facts (23)

The long tail: predicates that appear too rarely to warrant their own section. Filter or scroll to find a specific one. Each row links to its source.

23 facts
PredicateValueRef
Rdf:typeMachine Learning Model[1]
Rdf:typeMachine Learning Model[2]
AliasSVM[1]
Training Speedfast[1]
Performance With Sparse Datagood[1]
Implementation in Scikit LearnLinearSVC[1]
Implemented AsLinearSVC[1]
Mentioned BeforeLightgbm[1]
Belongs to ListFast Models[1]
Section Number4[1]
Optimizationspeed-optimized[1]
Advantagefast-training[1]
Advantage forsparse-data[1]
Learning Typesupervised-learning[1]
Algorithm Familysupport-vector-machine[1]
Section Index4[1]
Compared WithLightgbm[1]
Implementation DetailLinearSVC-optimized-for-speed[1]
Implementation Libraryscikit-learn[1]
Has Training SpeedFast[2]
Performs Well onSparse Data[2]
Inverse ofSlow Models[2]
Belongs toLinear Models[2]

Timeline

Timeline axis is valid_time — when each source says the fact was true in the world, not when Dontopedia learned about it. Retracted rows are kept for provenance; coloured stripes indicate the context kind.

typebeam/0e70d7ad-2e63-4603-8495-9b5dca2aa774
ex:MachineLearningModel
labelbeam/0e70d7ad-2e63-4603-8495-9b5dca2aa774
Linear Support Vector Machine
aliasbeam/0e70d7ad-2e63-4603-8495-9b5dca2aa774
SVM
trainingSpeedbeam/0e70d7ad-2e63-4603-8495-9b5dca2aa774
fast
performanceWithSparseDatabeam/0e70d7ad-2e63-4603-8495-9b5dca2aa774
good
implementationInScikitLearnbeam/0e70d7ad-2e63-4603-8495-9b5dca2aa774
LinearSVC
implementedAsbeam/0e70d7ad-2e63-4603-8495-9b5dca2aa774
LinearSVC
mentionedBeforebeam/0e70d7ad-2e63-4603-8495-9b5dca2aa774
ex:lightgbm
belongsToListbeam/0e70d7ad-2e63-4603-8495-9b5dca2aa774
ex:fast-models
sectionNumberbeam/0e70d7ad-2e63-4603-8495-9b5dca2aa774
4
optimizationbeam/0e70d7ad-2e63-4603-8495-9b5dca2aa774
speed-optimized
advantagebeam/0e70d7ad-2e63-4603-8495-9b5dca2aa774
fast-training
advantageForbeam/0e70d7ad-2e63-4603-8495-9b5dca2aa774
sparse-data
learningTypebeam/0e70d7ad-2e63-4603-8495-9b5dca2aa774
supervised-learning
algorithmFamilybeam/0e70d7ad-2e63-4603-8495-9b5dca2aa774
support-vector-machine
sectionIndexbeam/0e70d7ad-2e63-4603-8495-9b5dca2aa774
4
comparedWithbeam/0e70d7ad-2e63-4603-8495-9b5dca2aa774
ex:lightgbm
implementationDetailbeam/0e70d7ad-2e63-4603-8495-9b5dca2aa774
LinearSVC-optimized-for-speed
implementationLibrarybeam/0e70d7ad-2e63-4603-8495-9b5dca2aa774
scikit-learn
hasTrainingSpeedbeam/7835e578-f2e3-46a0-aa40-4497812bf8de
ex:fast
typebeam/7835e578-f2e3-46a0-aa40-4497812bf8de
ex:MachineLearningModel
performs-well-onbeam/7835e578-f2e3-46a0-aa40-4497812bf8de
ex:sparse-data
inverse-ofbeam/7835e578-f2e3-46a0-aa40-4497812bf8de
ex:slow-models
belongs-tobeam/7835e578-f2e3-46a0-aa40-4497812bf8de
ex:linear-models

References (2)

2 references
  1. ctx:claims/beam/0e70d7ad-2e63-4603-8495-9b5dca2aa774
    • full textbeam-chunk
      text/plain1 KBdoc:beam/0e70d7ad-2e63-4603-8495-9b5dca2aa774
      Show excerpt
      Decision Trees are relatively fast to train and can handle sparse data well. They are particularly useful as a baseline model. ### 4. **Linear Support Vector Machine (SVM)** A linear SVM can be quite fast to train, especially with sparse d
  2. ctx:claims/beam/7835e578-f2e3-46a0-aa40-4497812bf8de
    • full textbeam-chunk
      text/plain1 KBdoc:beam/7835e578-f2e3-46a0-aa40-4497812bf8de
      Show excerpt
      recall = recall_score(y_test, predictions) print(f'{name} Recall score: {recall:.3f}') print(classification_report(y_test, predictions)) print(confusion_matrix(y_test, predictions)) print('-' * 50) ``` ### Explanat

See also

Keep researching

Missing something or suspicious of what's here? Kick off a research session — a Claude agent will investigate, cite its sources, and file new facts into a dedicated context you can review before accepting into the shared view.