The DBLP Computer Science Bibliography: Evolution, Research Issues, Perspectives

Ley, Michael

doi:10.1007/3-540-45735-6_1

Cited by 342 publications

(216 citation statements)

References 4 publications

Supporting

Mentioning

195

Contrasting

Unclassified

Order By: Relevance

“…So the memory consumption for the materialized database graph G is small. Consider a real database graph G for DBLP in year 2004 [21]. The number of nodes is n = 1900K, and the number of edges is m = 5400K.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Finding Top-k Min-Cost Connected Trees in Databases

Ding

Wang

et al. 2007

2007 IEEE 23rd International Conference on Data Engineering

273

274

View full text Add to dashboard Cite

It is widely realized that the integration of database and information retrieval techniques will provide users with a wide range of high quality services. In this paper, we study processing an l-keyword query, p 1 , p 2 , · · · , p l , against a relational database which can be modeled as a weighted graph, G(V, E). Here V is a set of nodes (tuples) and E is a set of edges representing foreign key references between tuples. Let V i ⊆ V be a set of nodes that contain the keyword p i . We study finding top-k minimum cost connected trees that contain at least one node in every subset V i , and denote our problem as GST-k. When k = 1, it is known as a minimum cost group Steiner tree problem which is NPComplete. We observe that the number of keywords, l, is small, and propose a novel parameterized solution, with l as a parameter, to find the optimal GST-1, in time complexity O(3 l n + 2 l ((l + log n)n + m)), where n and m are the numbers of nodes and edges in graph G. Our solution can handle graphs with a large number of nodes. Our GST-1 solution can be easily extended to support GST-k, which outperforms the existing GST-k solutions over both weighted undirected/directed graphs. We conducted extensive experimental studies, and report our finding.

show abstract

Section: Discussionmentioning

confidence: 99%

“…We used two real datasets, DBLP [21] and MDB [24]. The database schema of DBLP is outlined in Figure 1 …”

Section: Experimental Studiesmentioning

confidence: 99%

Finding Top-k Min-Cost Connected Trees in Databases

Ding

Wang

et al. 2007

2007 IEEE 23rd International Conference on Data Engineering

273

274

View full text Add to dashboard Cite

show abstract

“…The data set used in our experiments is taken from the the DBLP Computer Science Bibliography [24] 2 enhanced with citation data [41]. We extracted a set of facts and relations in the form of a MySQL database from the original data set available at http://www.arnetminer.org/citation.…”

Section: Dblpmentioning

confidence: 99%

Type Extension Trees for feature construction and learning in relational domains

Jaeger

Lippi²,

Passerini

2013

Artificial Intelligence

View full text Add to dashboard Cite

Please cite this article in press as: M. Jaeger et al., Type extension trees for feature construction and learning in relational domains, Artificial Intelligence (2013), http://dx.doi.org/10. 1016/j.artint.2013.08.002 This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers we are providing this early version of the manuscript. The manuscript will undergo copyediting, typesetting, and review of the resulting proof before it is published in its final form. Please note that during the production process errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain. Type Extension Trees for Feature Construction and Learning in Relational DomainsManfred Jaeger AbstractType Extension Trees are a powerful representation language for "count-ofcount" features characterizing the combinatorial structure of neighborhoods of entities in relational domains. In this paper we present a learning algorithm for Type Extension Trees (TET) that discovers informative count-of-count features in the supervised learning setting. Experiments on bibliographic data show that TET-learning is able to discover the count-of-count feature underlying the definition of the h-index, and the inverse document frequency feature commonly used in information retrieval. We also introduce a metric on TET feature values. This metric is defined as a recursive application of the Wasserstein-Kantorovich metric. Experiments with a k-NN classifier show that exploiting the recursive count-of-count statistics encoded in TET values improves classification accuracy over alternative methods based on

show abstract

“…-The DBLP (Ley 2002) is a well-known database of scientific publications. We used a version including references between articles, as described in Tang et al (2008).…”

Section: Description Of Analyzed Networkmentioning

confidence: 99%

Characterizing the nature of interactions for cooperative creation in online social networks

Cazabet

Takeda

Hamasaki

2015

Soc. Netw. Anal. Min.

View full text Add to dashboard Cite

Many aspects of online social networks (OSN) have been studied in recent years. In this article, we focus on the question of interactions in large OSN. We propose methods to study these interactions, and apply them on a platform called Nico Nico Douga (NND), with the aim of understanding cooperative behaviors, taking the form of collective creation of music videos in NND. Our first contribution is a method that, starting from the network of interactions between users, evaluates three aspects: the impact of the social structure on these interactions, their concentration, and their reciprocity. We characterize the nature of interactions in NND, and compare it with four different datasets. We find that interactions in NND are more similar to a diffusion process, such as retweets in Tweeter, than to interpersonal communications, or even to cooperation in science. Our second contribution is a typology of roles for productions in a cooperative process. These roles are attributed based on the neighborhood of the nodes in the network of references between productions. We define direct roles, relative roles, and indirect roles. We subsequently study the frequency of these roles in NND. We show a correlation between the category of the contribution of a video (song, animation, etc.) and its probability of having a certain role. We also find a positive correlation between the most active users and the production of videos playing an important role in the cooperation process.

show abstract

The DBLP Computer Science Bibliography: Evolution, Research Issues, Perspectives

Cited by 342 publications

References 4 publications

Finding Top-k Min-Cost Connected Trees in Databases

Finding Top-k Min-Cost Connected Trees in Databases

Type Extension Trees for feature construction and learning in relational domains

Characterizing the nature of interactions for cooperative creation in online social networks

Contact Info

Product

Resources

About