Download JAR files tagged by ranking with all dependencies

Luzzu is a Quality Assessment Framework for Linked Open Datasets. It is a generic framework based on the Dataset Quality Ontology (daQ), allowing users to define their own quality metrics. Luzzu is an integrated platform that: - assesses Linked Data quality using a library of generic and user-provided domain specific quality metrics in a scalable manner; - provides queryable quality metadata on the assessed datasets; - assembles detailed quality reports on assessed datasets. Furthermore, the infrastructure: - scales for the assessment of big datasets; - can be easily extended by the users by creating their custom and domain-specific pluggable metrics, either by employing a novel declarative quality metric specification language or conventional imperative plugins; - employs a comprehensive ontology framework for representing and exchanging all quality related information in the assessment workflow; - implements quality-driven dataset ranking algorithms facilitating use-case driven discovery and retrieval.

Luzzu is a Quality Assessment Framework for Linked Open Datasets. It is a generic framework based on the Dataset Quality Ontology (daQ), allowing users to define their own quality metrics. Luzzu is an integrated platform that: - assesses Linked Data quality using a library of generic and user-provided domain specific quality metrics in a scalable manner; - provides queryable quality metadata on the assessed datasets; - assembles detailed quality reports on assessed datasets. Furthermore, the infrastructure: - scales for the assessment of big datasets; - can be easily extended by the users by creating their custom and domain-specific pluggable metrics, either by employing a novel declarative quality metric specification language or conventional imperative plugins; - employs a comprehensive ontology framework for representing and exchanging all quality related information in the assessment workflow; - implements quality-driven dataset ranking algorithms facilitating use-case driven discovery and retrieval.

This is an implementation of the Neural Gas algorithm on distance data (Relational Neural Gas) for unsupervised clustering. We recommend that you use the functions provided by the RelationalNeuralGas class for your purposes. All other classes and functions are utilities which are used by this central class. In particular, you can use RelationalNeuralGas.train() to obtain a RNGModel (i.e. a clustering of your data), and subsequently you can use RelationalNeuralGas.getAssignments() to obtain the resulting cluster assignments, and RelationalNeuralGas.classify() to cluster new points which are not part of the training data set. The underlying scientific work is summarized nicely in the dissertation "Topographic Mapping of Dissimilarity Datasets" by Alexander Hasenfuss (2009). The basic properties of an Relational Neural Gas algorithm are the following: 1.) It is relational: The data is represented only in terms of a pairwise distance matrix. 2.) It is a clustering method: The algorithm provides a clustering model, that is: After calculation, each data point should be assigned to a cluster (for this package here we only consider hard clustering, that is: each data point is assigned to exactly one cluster). 3.) It is a vector quantization method: Each cluster corresponds to a prototype, which is in the center of the cluster and data points are assigned to the cluster if and only if they are closest to this particular prototype. 4.) It is rank-based: The updates of the prototypes depend only on the distance ranking, not on the absolute value of the distances.

Races the cross validation error of competing attribute subsets. Use in conjuction with a ClassifierSubsetEval. RaceSearch has four modes: forward selection races all single attribute additions to a base set (initially no attributes), selects the winner to become the new base set and then iterates until there is no improvement over the base set. Backward elimination is similar but the initial base set has all attributes included and races all single attribute deletions. Schemata search is a bit different. Each iteration a series of races are run in parallel. Each race in a set determines whether a particular attribute should be included or not---ie the race is between the attribute being "in" or "out". The other attributes for this race are included or excluded randomly at each point in the evaluation. As soon as one race has a clear winner (ie it has been decided whether a particular attribute should be inor not) then the next set of races begins, using the result of the winning race from the previous iteration as new base set. Rank race first ranks the attributes using an attribute evaluator and then races the ranking. The race includes no attributes, the top ranked attribute, the top two attributes, the top three attributes, etc. It is also possible to generate a raked list of attributes through the forward racing process. If generateRanking is set to true then a complete forward race will be run---that is, racing continues until all attributes have been selected. The order that they are added in determines a complete ranking of all the attributes. Racing uses paired and unpaired t-tests on cross-validation errors of competing subsets. When there is a significant difference between the means of the errors of two competing subsets then the poorer of the two can be eliminated from the race. Similarly, if there is no significant difference between the mean errors of two competing subsets and they are within some threshold of each other, then one can be eliminated from the race.