Index

A B C D E F G H I J K L M N O P Q R S T U V W Z
All Classes|All Packages

H

HALFLIFE - Static variable in class es.uam.eps.ir.relison.grid.diffusion.expiration.ExponentialDecayExpirationConfigurator

Identifier for the half life of the expiration of an information piece.

HARMONIC - Static variable in class es.uam.eps.ir.relison.grid.sna.vertex.VertexMetricIdentifiers

Identifier for the harmonic centrality metric.

HarmonicCentrality<U> - Class in es.uam.eps.ir.relison.sna.metrics.distance.vertex

Metric that computes the harmonic centrality of the nodes (a version of closeness that uses the harmonic mean of the distances from the target node to the rest of nodes in the network.

HarmonicCentrality() - Constructor for class es.uam.eps.ir.relison.sna.metrics.distance.vertex.HarmonicCentrality

Basic constructor.

HarmonicCentrality(DistanceCalculator<U>) - Constructor for class es.uam.eps.ir.relison.sna.metrics.distance.vertex.HarmonicCentrality

Constructor.

HarmonicCentralityGridSearch<U> - Class in es.uam.eps.ir.relison.grid.sna.vertex

Grid for the harmonic centrality of a node.

HarmonicCentralityGridSearch() - Constructor for class es.uam.eps.ir.relison.grid.sna.vertex.HarmonicCentralityGridSearch

HARMONICMEAN - es.uam.eps.ir.relison.sna.metrics.distance.modes.ClosenessMode

Closeness is computed as the harmonic mean of the distances.

hasAdjacentEdges(int) - Method in interface es.uam.eps.ir.relison.graph.edges.Edges

Checks if a node has adjacent edges.

hasAdjacentEdges(int) - Method in class es.uam.eps.ir.relison.graph.edges.fast.FastEdges

hasAdjacentEdges(int) - Method in class es.uam.eps.ir.relison.graph.multigraph.edges.fast.FastMultiEdges

hasAdjacentEdges(int) - Method in interface es.uam.eps.ir.relison.graph.multigraph.edges.MultiEdges

Checks if a node has adjacent edges.

hasAdjacentNeighbors(U) - Method in class es.uam.eps.ir.relison.graph.complementary.ComplementaryGraph

hasAdjacentNeighbors(U) - Method in class es.uam.eps.ir.relison.graph.jung.JungGraph

hasAdjacentNeighbors(U) - Method in class es.uam.eps.ir.relison.graph.multigraph.fast.AbstractFastMultiGraph

hasAdjacentNeighbors(V) - Method in class es.uam.eps.ir.relison.graph.fast.AbstractFastGraph

hasAdjacentNeighbors(V) - Method in interface es.uam.eps.ir.relison.graph.Graph

Checks if the user has adjacent edges or not.

hasEdges(int) - Method in interface es.uam.eps.ir.relison.graph.edges.Edges

Checks if a node has adjacent or incident edges.

hasEdges(int) - Method in class es.uam.eps.ir.relison.graph.edges.fast.FastEdges

hasEdges(int) - Method in class es.uam.eps.ir.relison.graph.multigraph.edges.fast.FastMultiEdges

hasEdges(int) - Method in interface es.uam.eps.ir.relison.graph.multigraph.edges.MultiEdges

Checks if a node has adjacent or incident edges.

hasFirsts(int) - Method in class es.uam.eps.ir.relison.index.fast.FastUnweightedRelation

hasFirsts(int) - Method in class es.uam.eps.ir.relison.index.fast.FastWeightedRelation

hasFirsts(int) - Method in interface es.uam.eps.ir.relison.index.Relation

Checks whether the second element has relations with some first element.

hashCode() - Method in class es.uam.eps.ir.relison.diffusion.data.FastUser

hashCode() - Method in class es.uam.eps.ir.relison.diffusion.data.Feature

hashCode() - Method in class es.uam.eps.ir.relison.diffusion.data.Information

hashCode() - Method in class es.uam.eps.ir.relison.diffusion.simulation.UserState

hashCode() - Method in class es.uam.eps.ir.relison.utils.datatypes.CompTuple2oo

hashCode() - Method in class es.uam.eps.ir.relison.utils.datatypes.Tuple2oo

hasIncidentEdges(int) - Method in interface es.uam.eps.ir.relison.graph.edges.Edges

Checks if a node has incident edges.

hasIncidentEdges(int) - Method in class es.uam.eps.ir.relison.graph.edges.fast.FastEdges

hasIncidentEdges(int) - Method in class es.uam.eps.ir.relison.graph.multigraph.edges.fast.FastMultiEdges

hasIncidentEdges(int) - Method in interface es.uam.eps.ir.relison.graph.multigraph.edges.MultiEdges

Checks if a node has incident edges.

hasIncidentNeighbors(U) - Method in class es.uam.eps.ir.relison.graph.complementary.ComplementaryGraph

hasIncidentNeighbors(U) - Method in class es.uam.eps.ir.relison.graph.jung.JungGraph

hasIncidentNeighbors(U) - Method in class es.uam.eps.ir.relison.graph.multigraph.fast.AbstractFastMultiGraph

hasIncidentNeighbors(V) - Method in class es.uam.eps.ir.relison.graph.fast.AbstractFastGraph

hasIncidentNeighbors(V) - Method in interface es.uam.eps.ir.relison.graph.Graph

Checks if the user has incident edges or not.

hasMutualEdges(int) - Method in interface es.uam.eps.ir.relison.graph.edges.Edges

Checks if a node has mutual edges.

hasMutualEdges(int) - Method in class es.uam.eps.ir.relison.graph.edges.fast.FastEdges

hasMutualEdges(int) - Method in class es.uam.eps.ir.relison.graph.multigraph.edges.fast.FastMultiEdges

hasMutualEdges(int) - Method in interface es.uam.eps.ir.relison.graph.multigraph.edges.MultiEdges

Checks if a node has mutual edges.

hasMutualNeighbors(U) - Method in class es.uam.eps.ir.relison.graph.complementary.ComplementaryGraph

hasMutualNeighbors(U) - Method in class es.uam.eps.ir.relison.graph.jung.JungGraph

hasMutualNeighbors(U) - Method in class es.uam.eps.ir.relison.graph.multigraph.fast.AbstractFastMultiGraph

hasMutualNeighbors(V) - Method in class es.uam.eps.ir.relison.graph.fast.AbstractFastGraph

hasMutualNeighbors(V) - Method in interface es.uam.eps.ir.relison.graph.Graph

Checks if the user has mutual edges.

hasNeighbors(U) - Method in class es.uam.eps.ir.relison.graph.complementary.ComplementaryGraph

hasNeighbors(U) - Method in class es.uam.eps.ir.relison.graph.jung.JungGraph

hasNeighbors(U) - Method in class es.uam.eps.ir.relison.graph.multigraph.fast.AbstractFastMultiGraph

hasNeighbors(V) - Method in class es.uam.eps.ir.relison.graph.fast.AbstractFastGraph

hasNeighbors(V) - Method in interface es.uam.eps.ir.relison.graph.Graph

Checks if the user shares at least an edge with other user.

hasNeighbors(V, EdgeOrientation) - Method in interface es.uam.eps.ir.relison.graph.Graph

Checks if the user has neighbors.

hasNext() - Method in class es.uam.eps.ir.relison.content.index.freq.lucene.LuceneFreqVectorIterator

hasNext() - Method in class es.uam.eps.ir.relison.content.index.structure.lucene.LucenePostingsIterator

Checks if we can advance the iterator.

hasNext() - Method in class es.uam.eps.ir.relison.content.index.structure.positional.PositionsIterator

Indicates whether the list has a next position.

hasSeconds(int) - Method in class es.uam.eps.ir.relison.index.fast.FastUnweightedRelation

hasSeconds(int) - Method in class es.uam.eps.ir.relison.index.fast.FastWeightedRelation

hasSeconds(int) - Method in interface es.uam.eps.ir.relison.index.Relation

Checks whether the first element has relations with some second element.

hdi() - Method in class es.uam.eps.relison.links.recommendation.test.RecommenderTest

Hub Depressed Index algorithm

HDI - Static variable in class es.uam.eps.ir.relison.grid.links.recommendation.algorithms.AlgorithmIdentifiers

Identifier for the Hub Depressed Index algorithm.

HeuristicAverageEmbeddednessRerankerGridSearch<U> - Class in es.uam.eps.ir.relison.grid.links.recommendation.rerankers.swap.edge

Grid search for a reranker that optimizes the average embeddedness of the graph using heuristic approximations.

HeuristicAverageEmbeddednessRerankerGridSearch() - Constructor for class es.uam.eps.ir.relison.grid.links.recommendation.rerankers.swap.edge.HeuristicAverageEmbeddednessRerankerGridSearch

HeuristicAverageWeaknessRerankerGridSearch<U> - Class in es.uam.eps.ir.relison.grid.links.recommendation.rerankers.swap.edge

Grid search for a reranker that optimizes the average weakness of the graph using heuristic approximations.

HeuristicAverageWeaknessRerankerGridSearch() - Constructor for class es.uam.eps.ir.relison.grid.links.recommendation.rerankers.swap.edge.HeuristicAverageWeaknessRerankerGridSearch

HEURISTICAVGEMBEDDEDNESS - Static variable in class es.uam.eps.ir.relison.grid.links.recommendation.rerankers.RerankerIdentifiers

Identifier for the swap reranker promoting average embeddedness with heuristics.

HEURISTICAVGWEAKNESS - Static variable in class es.uam.eps.ir.relison.grid.links.recommendation.rerankers.RerankerIdentifiers

Identifier for the swap reranker promoting average weakness with heuristics.

HeuristicEmbedednessReranker<U> - Class in es.uam.eps.ir.relison.links.recommendation.reranking.global.swap.edge

Swap reranker for optimizing the embeddedness of the graph.

HeuristicEmbedednessReranker(double, int, Supplier<Normalizer<U>>, Graph<U>, int) - Constructor for class es.uam.eps.ir.relison.links.recommendation.reranking.global.swap.edge.HeuristicEmbedednessReranker

Constructor

HeuristicWeaknessReranker<U> - Class in es.uam.eps.ir.relison.links.recommendation.reranking.global.swap.edge

Swap reranker for optimizing the embeddedness of the graph.

HeuristicWeaknessReranker(double, int, Supplier<Normalizer<U>>, Graph<U>, int) - Constructor for class es.uam.eps.ir.relison.links.recommendation.reranking.global.swap.edge.HeuristicWeaknessReranker

Constructor

HITS<U> - Class in es.uam.eps.ir.relison.links.recommendation.algorithms.standalone.randomwalk

Hiperlink-Induced Topic Search (HITS) recommender.

HITS<U> - Class in es.uam.eps.ir.relison.sna.metrics.vertex

Computes the HITS values of the different nodes in a graph.

HITS - Static variable in class es.uam.eps.ir.relison.grid.links.recommendation.algorithms.AlgorithmIdentifiers

Identifier for the HITS algorithm.

HITS - Static variable in class es.uam.eps.ir.relison.grid.sna.vertex.VertexMetricIdentifiers

Identifier for the HITS score.

HITS(boolean) - Constructor for class es.uam.eps.ir.relison.sna.metrics.vertex.HITS

Constructor for not personalized PageRank.

HITS(FastGraph<U>, boolean) - Constructor for class es.uam.eps.ir.relison.links.recommendation.algorithms.standalone.randomwalk.HITS

Constructor.

hitsAuthorities() - Method in class es.uam.eps.ir.relison.metrics.complementarymetrics.VertexMetricsTest

HITSGridSearch<U> - Class in es.uam.eps.ir.relison.grid.links.recommendation.algorithms.standalone.randomwalks

Grid search generator for the HITS algorithm.

HITSGridSearch<U> - Class in es.uam.eps.ir.relison.grid.sna.vertex

Grid for the HITS value of a node.

HITSGridSearch() - Constructor for class es.uam.eps.ir.relison.grid.links.recommendation.algorithms.standalone.randomwalks.HITSGridSearch

HITSGridSearch() - Constructor for class es.uam.eps.ir.relison.grid.sna.vertex.HITSGridSearch

hitsHubs() - Method in class es.uam.eps.ir.relison.metrics.complementarymetrics.VertexMetricsTest

HITTING - Static variable in class es.uam.eps.ir.relison.grid.links.recommendation.algorithms.AlgorithmIdentifiers

Identifier for the hitting time (PageRank-based) algorithm.

HITTINGPERS - Static variable in class es.uam.eps.ir.relison.grid.links.recommendation.algorithms.AlgorithmIdentifiers

Identifier for the hitting time (personalized PageRank-based) algorithm.

hittingTime - Variable in class es.uam.eps.ir.relison.links.recommendation.algorithms.standalone.randomwalk.CommuteTime

A hitting time implementation.

HittingTimeGridSearch<U> - Class in es.uam.eps.ir.relison.grid.links.recommendation.algorithms.standalone.randomwalks

Grid search generator for PageRank algorithm.

HittingTimeGridSearch() - Constructor for class es.uam.eps.ir.relison.grid.links.recommendation.algorithms.standalone.randomwalks.HittingTimeGridSearch

HittingTimePersPageRankGridSearch<U> - Class in es.uam.eps.ir.relison.grid.links.recommendation.algorithms.standalone.randomwalks

Grid search generator for PageRank algorithm.

HittingTimePersPageRankGridSearch() - Constructor for class es.uam.eps.ir.relison.grid.links.recommendation.algorithms.standalone.randomwalks.HittingTimePersPageRankGridSearch

HKVUpdateableFactorizer<U,I> - Class in es.uam.eps.ir.relison.links.recommendation.updateable.mf.als

Implicit matrix factorization of Hu, Koren and Volinsky.

HKVUpdateableFactorizer(double, double, DoubleUnaryOperator, int) - Constructor for class es.uam.eps.ir.relison.links.recommendation.updateable.mf.als.HKVUpdateableFactorizer

Constructor.

HKVUpdateableFactorizer(double, DoubleUnaryOperator, int) - Constructor for class es.uam.eps.ir.relison.links.recommendation.updateable.mf.als.HKVUpdateableFactorizer

Constructor.

hpi() - Method in class es.uam.eps.relison.links.recommendation.test.RecommenderTest

Hub Promoted Index algorithm

HPI - Static variable in class es.uam.eps.ir.relison.grid.links.recommendation.algorithms.AlgorithmIdentifiers

Identifier for the Hub Promoted Index algorithm.

HubDepressedIndex<U> - Class in es.uam.eps.ir.relison.links.recommendation.algorithms.standalone.foaf

Recommender that uses the hub depressed index of the neighbors: given the number of common neighbors between two users, the recommendation score is divided by the size of either the target user or the candidate user: the user with a larger number of them.

HubDepressedIndex(FastGraph<U>, EdgeOrientation, EdgeOrientation) - Constructor for class es.uam.eps.ir.relison.links.recommendation.algorithms.standalone.foaf.HubDepressedIndex

Constructor.

HubDepressedIndexGridSearch<U> - Class in es.uam.eps.ir.relison.grid.links.recommendation.algorithms.standalone.foaf

Grid search generator for Hub Depressed Index (HDI) algorithm.

HubDepressedIndexGridSearch() - Constructor for class es.uam.eps.ir.relison.grid.links.recommendation.algorithms.standalone.foaf.HubDepressedIndexGridSearch

hubIdx - Variable in class es.uam.eps.ir.relison.links.recommendation.algorithms.standalone.bipartite.AverageCosineSimilarity

Identifiers of the hubs

hubIdx - Variable in class es.uam.eps.ir.relison.links.recommendation.algorithms.standalone.bipartite.CentroidCosineSimilarity

Identifiers of the hubs.

hubIdx - Variable in class es.uam.eps.ir.relison.links.recommendation.algorithms.standalone.bipartite.MaximumCosineSimilarity

Identifiers of the hubs.

HubPromotedIndex<U> - Class in es.uam.eps.ir.relison.links.recommendation.algorithms.standalone.foaf

Recommender that uses the hub depressed index of the neighbors: given the number of common neighbors between two users, the recommendation score is divided by the size of either the target user or the candidate user: the user with a smaller number of them.

HubPromotedIndex(FastGraph<U>, EdgeOrientation, EdgeOrientation) - Constructor for class es.uam.eps.ir.relison.links.recommendation.algorithms.standalone.foaf.HubPromotedIndex

Constructor.

HubPromotedIndexGridSearch<U> - Class in es.uam.eps.ir.relison.grid.links.recommendation.algorithms.standalone.foaf

Grid search generator for Hub Promoted Index (HPI) algorithm.

HubPromotedIndexGridSearch() - Constructor for class es.uam.eps.ir.relison.grid.links.recommendation.algorithms.standalone.foaf.HubPromotedIndexGridSearch

hubs - Variable in class es.uam.eps.ir.relison.links.recommendation.algorithms.standalone.bipartite.BipartiteRecommender

A map between the hubs identifiers and their true representation (the node in the original graph).

hubs - Variable in class es.uam.eps.ir.relison.sna.metrics.vertex.HITS

Hubs values.

A B C D E F G H I J K L M N O P Q R S T U V W Z
All Classes|All Packages