mining

package

v0.12.0 Latest Latest Go to latest Published: Feb 13, 2020 License: BSD-3-Clause, BSD-3-Clause Imports: 0 Imported by: 0

Details

Valid go.mod file

The Go module system was introduced in Go 1.11 and is the official dependency management solution for Go.
Redistributable license

Redistributable licenses place minimal restrictions on how software can be used, modified, and redistributed.
Tagged version

Modules with tagged versions give importers more predictable builds.
Stable version

When a project reaches major version v1 it is considered stable.
Learn more about best practices

Repository

github.com/shuLhan/share

Links

Open Source Insights

README ¶

go-mining

Go-mining is a small library for data mining.

The library is written in Go language.

Features

Classifiers

CART
Random Forest
Cascaded Random Forest
K-Nearest Neighbourhood

Resampling

SMOTE
LN-SMOTE (Local Neigbourhood SMOTE)

Miscellaneous

Gini index

Documentation ¶

Index ¶

Variables

Constants ¶

This section is empty.

Variables ¶

View Source

var BadWords = []string{
	"666", "da", "dont", "dosent", "whatever", "guy", "hi", "nazi", "sup",
	"guise", "loser", "thats", "ugly", "wanna", "whats", "wont", "gotta",
	"bloody", "fart", "pot", "prick", "stink", "smells", "smelly", "alot",
	"dunno", "gotcha",
}

BadWords contain list of colloquial words or bad writing words.

View Source

var BiasedWords = []string{
	"cutting-edge", "single-handedly", "well-established", "well-known",
	"world-class", "absolute", "acclaimed", "amazing", "astonishing",
	"authoritative", "beautiful", "best", "boreing", "boring",
	"brilliant", "canonical", "cares", "celebrated", "charismatic",
	"classic", "coolest", "defining", "definitive", "eminent", "enigma",
	"ever", "everyone", "exciting", "extraordinary", "fabulous", "famous",
	"fantastic", "fat", "fully", "genius", "global", "great", "greatest",
	"hate", "huge", "iconic", "idiotic", "immensely", "impactful",
	"incendiary", "indisputable", "infamous", "influential", "innovative",
	"inspired", "intriguing", "lame", "leader", "leading", "legendary",
	"like", "major", "masterly", "mature", "memorable", "most", "notable",
	"outstanding", "pioneer", "popular", "prestigious", "probably",
	"really", "remarkable", "renowned", "respected", "seminal",
	"significant", "skillful", "solution", "staunch", "strange", "super",
	"talented", "top", "total", "totally", "transcendent", "ugly",
	"undoubtedly", "unique", "virtually", "virtuoso", "visionary",
	"weird", "worst",
}

BiasedWords contain list of colloquial words with high bias.

View Source

var PronounWords = []string{
	"i", "me", "mine", "my", "myself", "our", "ours", "ourself",
	"ourselves", "selves", "thee", "thine", "thou", "thy", "thyself",
	"us", "we", "y'all", "y'all", "y'all's", "yis", "you", "you-uns",
	"your", "yours", "yourself", "yourselves", "yourselves", "yous",
	"yous's", "youse", "youse",
}

PronounWords contains list of first and second person pronouns including slangs.

View Source

var SexWords = []string{
	"anal", "breast", "breasts", "buttocks", "dildo", "dildos", "erect",
	"nipple", "nipples", "penis", "sex", "sodomized", "sodomy", "vagina",
	"vibrator", "vibrators",
}

SexWords contain list of non-vulgar sex-related words.

View Source

var VulgarWords = []string{}/* 779 elements not displayed */

VulgarWords contain list of vulgar and offensive words in informal and slangs.

Functions ¶

This section is empty.

Types ¶

This section is empty.

Source Files ¶

View all Source files

dict.go

Directories ¶

Path	Synopsis
classifier
cart Package cart implement the Classification and Regression Tree by Breiman, et al.	Package cart implement the Classification and Regression Tree by Breiman, et al.
crf Package crf implement the cascaded random forest algorithm, proposed by Baumann et.al in their paper: Baumann, Florian, et al.	Package crf implement the cascaded random forest algorithm, proposed by Baumann et.al in their paper: Baumann, Florian, et al.
rf Package rf implement ensemble of classifiers using random forest algorithm by Breiman and Cutler.	Package rf implement ensemble of classifiers using random forest algorithm by Breiman and Cutler.
gain
gini Package gini contain function to calculating Gini gain.	Package gini contain function to calculating Gini gain.
knn Package knn implement the K Nearest Neighbor using Euclidean to compute the distance between samples.	Package knn implement the K Nearest Neighbor using Euclidean to compute the distance between samples.
math Package math provide generic functions working with math.	Package math provide generic functions working with math.
resampling Package resampling provide common interface, constants, and methods for resampling modules.	Package resampling provide common interface, constants, and methods for resampling modules.
lnsmote Package lnsmote implement the Local-Neighborhood algorithm from the paper, Maciejewski, Tomasz, and Jerzy Stefanowski.	Package lnsmote implement the Local-Neighborhood algorithm from the paper, Maciejewski, Tomasz, and Jerzy Stefanowski.
smote Package smote resamples a dataset by applying the Synthetic Minority Oversampling TEchnique (SMOTE).	Package smote resamples a dataset by applying the Synthetic Minority Oversampling TEchnique (SMOTE).
tree
binary Package binary contain implementation of binary tree.	Package binary contain implementation of binary tree.

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL