Download JAR files tagged by general with all dependencies
metaCost from group nz.ac.waikato.cms.weka (version 1.0.3)
This metaclassifier makes its base classifier cost-sensitive using the method specified in
Pedro Domingos: MetaCost: A general method for making classifiers cost-sensitive. In: Fifth International Conference on Knowledge Discovery and Data Mining, 155-164, 1999.
This classifier should produce similar results to one created by passing the base learner to Bagging, which is in turn passed to a CostSensitiveClassifier operating on minimum expected cost. The difference is that MetaCost produces a single cost-sensitive classifier of the base learner, giving the benefits of fast classification and interpretable output (if the base learner itself is interpretable). This implementation uses all bagging iterations when reclassifying training data (the MetaCost paper reports a marginal improvement when only those iterations containing each training instance are used in reclassifying that instance).
0 downloads
Artifact metaCost
Group nz.ac.waikato.cms.weka
Version 1.0.3
Last update 06. February 2013
Organization University of Waikato, Hamilton, NZ
URL http://weka.sourceforge.net/doc.packages/metaCost
License GNU General Public License 3
Dependencies amount 1
Dependencies weka-dev,
There are maybe transitive dependencies!
Group nz.ac.waikato.cms.weka
Version 1.0.3
Last update 06. February 2013
Organization University of Waikato, Hamilton, NZ
URL http://weka.sourceforge.net/doc.packages/metaCost
License GNU General Public License 3
Dependencies amount 1
Dependencies weka-dev,
There are maybe transitive dependencies!
jlue-archetypes from group net.sf.jlue (version 1.1)
Group: net.sf.jlue Artifact: jlue-archetypes
Show all versions
Show all versions
There is no JAR file uploaded. A download is not possible! Please choose another version.
0 downloads
Artifact jlue-archetypes
Group net.sf.jlue
Version 1.1
Last update 25. December 2010
Organization not specified
URL http://www.Jlue.org
License not specified
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group net.sf.jlue
Version 1.1
Last update 25. December 2010
Organization not specified
URL http://www.Jlue.org
License not specified
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
jlue-core from group net.sf.jlue (version 1.3)
Artifact jlue-core
Group net.sf.jlue
Version 1.3
Last update 25. December 2010
Organization not specified
URL http://www.Jlue.org
License not specified
Dependencies amount 6
Dependencies slf4j-api, logback-core, logback-access, logback-classic, commons-codec, spring,
There are maybe transitive dependencies!
Group net.sf.jlue
Version 1.3
Last update 25. December 2010
Organization not specified
URL http://www.Jlue.org
License not specified
Dependencies amount 6
Dependencies slf4j-api, logback-core, logback-access, logback-classic, commons-codec, spring,
There are maybe transitive dependencies!
jlue from group net.sf.jlue (version 1.1)
J2EE integrated development framework,for the rapid build
enterprise applications.Based on Struts,Spring,Hibernate constructed
to provide Web systems development functions commonly used components.
Simply configure can be solved the general problems in the process of
developing encountered.
For example,already has built in login
interface,user and role management,base AOP paging,logging feature and
a lot more.
It's a Java package, a class library for Java programmers.
It's not an application for end-users in itself, but something that
programmers can embed into their products.
Group: net.sf.jlue Artifact: jlue
Show all versions
Show all versions
There is no JAR file uploaded. A download is not possible! Please choose another version.
0 downloads
Artifact jlue
Group net.sf.jlue
Version 1.1
Last update 24. December 2010
Organization Jlue team
URL http://jlue.sf.net
License The Apache Software License, Version 2.0
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group net.sf.jlue
Version 1.1
Last update 24. December 2010
Organization Jlue team
URL http://jlue.sf.net
License The Apache Software License, Version 2.0
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
toniclf from group net.sf.squirrel-sql.thirdparty-non-maven (version 1.0.5)
This is the tonic look-and-feel packaged to be distributed with the SQuirreLSQL client.
This pluggable look and feel is a free substitute for the default native look and feel of Swing,
'Metal', distributed under the GNU Lesser General Public License. Metal lacks both in usability and
aesthetics. It contains considerable graphical noise, distracting the user from the key elements of
the GUI.
Tonic, on the other hand, tries to provide a clean, balanced look and an improved feel. Tonic is
available free of charge both for commercial and non-commercial applications. It lends a
professional touch and a very tidy and clean interface to your Swing based applications.
Artifact toniclf
Group net.sf.squirrel-sql.thirdparty-non-maven
Version 1.0.5
Last update 03. October 2009
Organization not specified
URL http://www.digitprop.com/tonic/tonic.php
License GNU Lesser General Public License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group net.sf.squirrel-sql.thirdparty-non-maven
Version 1.0.5
Last update 03. October 2009
Organization not specified
URL http://www.digitprop.com/tonic/tonic.php
License GNU Lesser General Public License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
romaji from group com.github.jikyo (version 0.0.4)
`Romaji` is a converter library to romanize Japanese hiragana/katakana string by standard and IME typing style.
Even though [icu::Transliterator](http://userguide.icu-project.org/transforms/general) already has provided the same functions, and returns only one romanized string.
However, there exists several different romanization systems, so one hiragana/katakana string has so many romanize string.
For example, `"ちゃ"` can be romanized as `"cha"`, `"tya"`, `"chixya"`, `"tixya"`, `"chilya"`, or `"tilya"`.
`Romaji` provides romanized strings as many as possible.
If an input string contained non hiragana/katakana characters (includes kanji), `Romaji` return the characters as same as the input.
For example, `Romaji` converts the input `"お茶の水"` to `"o茶no水"`.
The mapping from hiragana/katakana to romaji is based on common IME's system to type Japanese on a computer.
Therefor, `Romaji` does not directly implement the standard system like Hepburn, Nihon-shiki or Kunrei-shiki, but includes them.
0 downloads
Artifact romaji
Group com.github.jikyo
Version 0.0.4
Last update 14. May 2019
Organization not specified
URL https://github.com/jikyo/romaji4j
License The Apache Software License, Version 2.0
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group com.github.jikyo
Version 0.0.4
Last update 14. May 2019
Organization not specified
URL https://github.com/jikyo/romaji4j
License The Apache Software License, Version 2.0
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
jburg from group net.sourceforge.jburg (version 1.10.3)
A bottom-up rewrite machine is a compiler construction tool that is often used in the compiler's back end to
convert a tree-structured representation of a program into machine code -- or, in Java's case, bytecode.
JBurg can also be used as a general-purpose dynamic programming engine. JBurg is descended from iburg-class
BURGs, described in Fraser, Hanson, and Proebsting's paper, "Engineering a Simple, Efficient Code Generator
Generator."
JBurg brings similar O(N) minimum-cost tree rewriting capabilities to Java, and also allows the programmer to
specify transitions between non-terminal states, that are significantly more powerful than iburg's transitive
closures: JBurg transformation rules allow the transformation to inject additional program logic, which makes
a JBurg specification more like a grammar than like a list of pattern-matching rules.
0 downloads
Artifact jburg
Group net.sourceforge.jburg
Version 1.10.3
Last update 24. February 2016
Organization not specified
URL http://jburg.sourceforge.net/
License Common Public License Version 1.0
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group net.sourceforge.jburg
Version 1.10.3
Last update 24. February 2016
Organization not specified
URL http://jburg.sourceforge.net/
License Common Public License Version 1.0
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
adp from group de.cit-ec.tcs.alignment (version 3.1.1)
This module contains a more general approach to construct
AlignmentAlgorithms by relying on the theoretical concept of Algebraic
Dynamic Programming (ADP) as developed by Giegerich et al.
ADP defines four ingredients for an alignment algorithm:
1.) A signature that defines the permitted alignment operations.
Operations are just function templates with an associated arity, meaning
the number of arguments it takes from the left sequence and from the
right sequence.
In the TCSAlignmentToolbox we have a fixed signature with the following
operations:
REPLACEMENT(1, 1), DELETION(1, 0), INSERTION(0, 1), SKIPDELETION(1, 0)
and SKIPINSERTION(0, 1)
2.) A regular tree grammar that produces alignments, that is: sequences
of operations, in a restricted fashion.
3.) An algebra that can translate such trees to a cost. In the
TCSAlignmentToolbox this is a Comparator.
4.) A choice function, in case of the TCSAlignmentToolbox: the strict
minimum or the soft minimum.
An alignment algorithm in the TCSAlignmentToolbox sense of the word then
is the combination of choice function and grammar. While we provide
hardcoded versions of these combinations in the main package, the adp
package allows you to create your own grammars. You can combine them with
a choice function by instantiating one of the Algorithm classes provided
in this package with a grammar of your choice.
For example:
AlignmentAlgorithm algo = new SoftADPScoreAlgorithm(my_grammar, comparator);
creates an alignment algorithm that implicitly produces all possible
alignments your grammar can construct with the given input, translates them
to a cost using the algebra/comparator you provided and applies the
soft minimum to return the score. This all gets efficient by dynamic
programming.
Note that there is runtime overhead when using this method in comparison
with the hardcoded algorithms. But for complicated grammars this is a much
easier way to go.
For more information on the theory, please refer to my master's thesis:
"Adaptive Affine Sequence Alignment using Algebraic Dynamic Programming"
0 downloads
Artifact adp
Group de.cit-ec.tcs.alignment
Version 3.1.1
Last update 26. October 2018
Organization not specified
URL http://openresearch.cit-ec.de/projects/tcs
License The GNU Affero General Public License, Version 3
Dependencies amount 1
Dependencies algorithms,
There are maybe transitive dependencies!
Group de.cit-ec.tcs.alignment
Version 3.1.1
Last update 26. October 2018
Organization not specified
URL http://openresearch.cit-ec.de/projects/tcs
License The GNU Affero General Public License, Version 3
Dependencies amount 1
Dependencies algorithms,
There are maybe transitive dependencies!
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
- 30
- 31
- 32
- 33
- 34
- 35
- 36
- 37
- 38
- 39
- 40
- 41
- 42
- 43
- 44
- 45
- 46
- 47
- 48
- 49
- 50
- 51
- 52
- 53
- 54
- 55
- 56
- 57
- 58
- 59
- 60
- 61
- 62
- 63
- 64
- 65
- 66
- 67
- 68
- 69
- 70
- 71
- 72
- 73
- 74
- 75
- 76
- 77
- 78
- 79
- 80
- 81
- 82
- 83
- 84
- 85
- 86
- 87
- 88
- 89
- 90
- 91
- 92
- 93
- 94
- 95
- 96
- 97
- 98
- 99
- 100
- 101
- 102
- 103
- 104
- 105
- 106
- 107
- 108
- 109
- 110
- 111
- 112
- 113
- 114
- 115
- 116
- 117
- 118
- 119
- 120
- 121
- 122
- 123
- 124
- 125
- 126
- 127
- 128
- 129
- 130
- 131
- 132
- 133
- 134
- 135
- 136
- 137
- 138
- 139
- 140
- 141
- 142
- 143
- 144
- 145
- 146
- 147
- 148
- 149
- 150
- 151
- 152
- 153
- 154
- 155
- 156
- 157
- 158
- 159
- 160
- 161
- 162
- 163
- 164
- 165
- 166
- 167
- 168
- 169
- 170
- 171
- 172
- 173
- 174
- 175
- 176
- 177
- 178
Page 178 from 178 (items total 1778)