Learning Non-Uniform Hypergraph for Multi-Object Tracking

The majority of Multi-Object Tracking (MOT) algorithms based on the tracking-by-detection scheme do not use higher order dependencies among objects or tracklets, which makes them less effective in handling complex scenarios. In this work, we present a new near-online MOT algorithm based on non-uniform hypergraph, which can model different degrees of dependencies among tracklets in a unified objective. The nodes in the hypergraph correspond to the tracklets and the hyperedges with different degrees encode various kinds of dependencies among them. Specifically, instead of setting the weights of hyperedges with different degrees empirically, they are learned automatically using the structural support vector machine algorithm (SSVM). Several experiments are carried out on various challenging datasets (i.e., PETS09, ParkingLot sequence, SubwayFace, and MOT16 benchmark), to demonstrate that our method achieves favorable performance against the state-of-the-art MOT methods.

Download Full-text

Develop Local Fuzzy Classifier to Modify Low-Confidence Output of Global Classifier

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.989-994.1762 ◽

2014 ◽

Vol 989-994 ◽

pp. 1762-1765

Author(s):

Ping Ling ◽

Xiang Sheng Rong ◽

Yong Quan Dong ◽

Guo Sheng Hao

Keyword(s):

Support Vector Machine ◽

Nearest Neighbor ◽

State Of The Art ◽

The State ◽

Support Vector ◽

K Nearest Neighbor ◽

Fuzzy Classifier ◽

Local Classifier

This paper proposes an assembling classifier consisting of a global classifier and a local classifier, named as GCLC. To this end, we present a weighted Support Vector Machine (wSVM) that serves as the global classifier, and a fuzzy k-nearest neighbor (fkNN) that serves as the local one. When a query arrives, wSVM labels it firstly. If the global decision is below some threshold, the local fkNN works to provide an improved decision. Extensive experiments on real datasets demonstrate the performance of GCLC compared with the state of the art.

Download Full-text

KLASIFIKASI SMS SPAM MENGGUNAKAN SUPPORT VECTOR MACHINE

Jurnal Pilar Nusa Mandiri ◽

10.33480/pilar.v15i2.693 ◽

2019 ◽

Vol 15 (2) ◽

pp. 275-280

Author(s):

Agus Setiyono ◽

Hilman F Pardede

Keyword(s):

Data Mining ◽

Support Vector Machine ◽

Decision Tree ◽

Naive Bayes ◽

Naïve Bayes ◽

Support Vector ◽

Spam Detection ◽

Support Vector Machine Algorithm ◽

Data Mining Techniques ◽

To Receive

It is now common for a cellphone to receive spam messages. Great number of received messages making it difficult for human to classify those messages to Spam or no Spam. One way to overcome this problem is to use Data Mining for automatic classifications. In this paper, we investigate various data mining techniques, named Support Vector Machine, Multinomial Naïve Bayes and Decision Tree for automatic spam detection. Our experimental results show that Support Vector Machine algorithm is the best algorithm over three evaluated algorithms. Support Vector Machine achieves 98.33%, while Multinomial Naïve Bayes achieves 98.13% and Decision Tree is at 97.10 % accuracy.

Download Full-text