Concepts inHyperincident connected components of tagging networks
Connected component (graph theory)
In graph theory, a connected component of an undirected graph is a subgraph in which any two vertices are connected to each other by paths, and which is connected to no additional vertices in the supergraph. For example, the graph shown in the illustration on the right has three connected components. A graph that is itself connected has exactly one connected component, consisting of the whole graph.
more from Wikipedia
Tag (metadata)
In information systems, a tag is a non-hierarchical keyword or term assigned to a piece of information (such as an Internet bookmark, digital image, or computer file). This kind of metadata helps describe an item and allows it to be found again by browsing or searching. Tags are generally chosen informally and personally by the item's creator or by its viewer, depending on the system.
more from Wikipedia
Computer network
A computer network, often simply referred to as a network, is a collection of hardware components and computers interconnected by communication channels that allow sharing of resources and information. Where at least one process in one device is able to send/receive data to/from at least one process residing in a remote device, then the two devices are said to be in a network.
more from Wikipedia
Complex network
In the context of network theory, a complex network is a graph (network) with non-trivial topological features¿features that do not occur in simple networks such as lattices or random graphs but often occur in real graphs. The study of complex networks is a young and active area of scientific research inspired largely by the empirical study of real-world networks such as computer networks and social networks.
more from Wikipedia
Giant component
In network theory, a giant component is a connected component of a given random graph that contains a constant fraction of the entire graph's vertices. Giant components are a prominent feature of the Erd¿s¿Rényi model of random graphs, in which each possible edge connecting pairs of a given set of n vertices is present, independently of the other edges, with probability p.
more from Wikipedia
Social bookmarking
Social bookmarking is a method for Internet users to organize, store, manage and search for bookmarks of resources online. Many online bookmark management services have launched since 1996; Delicious, founded in 2003, popularized the terms "social bookmarking" and "tagging". Tagging is a significant feature of social bookmarking systems, enabling users to organize their bookmarks in flexible ways and develop shared vocabularies known as folksonomies.
more from Wikipedia
Hypergraph
An example hypergraph, with and . ]] In mathematics, a hypergraph is a generalization of a graph, where an edge can connect any number of vertices. Formally, a hypergraph is a pair where is a set of elements, called nodes or vertices, and is a set of non-empty subsets of called hyperedges or links. Therefore, is a element of, where is the power set of . While graph edges are pairs of nodes, hyperedges are arbitrary sets of nodes, and can therefore contain an arbitrary number of nodes.
more from Wikipedia
Data set
A data set (or dataset) is a collection of data, usually presented in tabular form. Each column represents a particular variable. Each row corresponds to a given member of the data set in question. It lists values for each of the variables, such as height and weight of an object. Each value is known as a datum. The data set may comprise data for one or more members, corresponding to the number of rows.
more from Wikipedia