• Corpus ID: 976407

A Multi-Relational Network to Support the Scholarly Communication Process

@article{Rodriguez2006AMN,
  title={A Multi-Relational Network to Support the Scholarly Communication Process},
  author={Michael A. Rodriguez},
  journal={ArXiv},
  year={2006},
  volume={abs/cs/0601121}
}
The general purpose of the scholarly communication process is to support the creation and dissemination of ideas within the scientific community. At a finer granularity, there exists multiple stage ... 
View PDF on arXiv
14 Citations
Background Citations
5
Methods Citations
1

Figures and Tables from this paper

14 Citations

Citation Type

Citation Type

Analysis of Neighbourhoods in Multi-layered Dynamic Social Networks
TLDR
Some new structural measures for multi-layered social networks are proposed in the paper and will help to understand the semantic of human relations.
A Recommender System to Support the Scholarly Communication Process
TLDR
An overview of a context-sensitive recommender system to support the scholarly communication process that is based on the standards and technology set forth by the Semantic Web initiative is presented.
Multi-layered Social Networks
TLDR
This essay aims to summarize existing knowledge about one concept which has many different names i.e. the concept of Multi-layered Social Network, also known as Layered social network, Multi-relational socialnetwork, Multidimensional social network , Multiplex social network.
Computer Supported Collaborative Research
TLDR
A full definition and specification of the CSCR domain is provided with a view to setting up an e-laboratory designed to support research students and their supervisors wherever they are located, as well as general collaborative research supporting diverse faculties and business developments.
The RDF virtual machine
Exposing multi-relational networks to single-relational network analysis algorithms
A Method for Group Extraction and Analysis in Multilayer Social Networks
TLDR
A new approach to prediction of group evolution in the social network was developed and it was shown, that using even a simple sequence, which consists of several preceding groups sizes and events, as an input for the classifier, the learned model can produce very good results also for simple classifiers.
Complexity and Self-Organization
TLDR
This entry introduces some of the main concepts and methods of the science studying complex, self-organizing systems, and networks, in a nontechnical manner, and has obvious applications in information science when studying networks of authors and their publications.
E-scholia: Scenari Digitali per la Comunicazione Scientifica in Ambito Filologico
TLDR
The implemented prototype of an e-journal on classical philology highlighted how suitable the text encoding using an XML-compliant format is in order to provide scholars reading on-line publications with advanced features and value added services.
Ranking Companies Based on Multiple Social Networks Mined from the Web
TLDR
The proposed model combines social network mining and ranking learning, which further uses multiple relations on the Web to explain arbitrary rankings in the real world and by combining proposed network-based features, the prediction results are further improved.
...
...

References

SHOWING 1-10 OF 22 REFERENCES
The convergence of digital libraries and the peer-review process
TLDR
The contributions set forth by this paper emphasize a deconstructed publication model in which the peer-review process is mediated by an Open Archives Initiative Protocol for Metadata Harvesting (OAI-PMH) peer- Review service, and suggest a set of peer- review specific metadata tags that can accompany a pre-print's existing metadata record.
Co-authorship networks in the digital library research community
An architecture for the aggregation and analysis of scholarly usage data
  • J. Bollen, H. V. D. Sompel
  • Computer Science
    Proceedings of the 6th ACM/IEEE-CS Joint Conference on Digital Libraries (JCDL '06)
  • 2006
TLDR
A technical, standards-based architecture for sharing usage information is presented, made OAI-PMH harvestable so that usage information exposed by many linking servers can be aggregated to facilitate the creation of value-added services with a reach beyond that of a single community or a single information service.
Information retrieval by constrained spreading activation in semantic networks
Application of Spreading Activation Techniques in Information Retrieval
  • F. Crestani
  • Computer Science
    Artificial Intelligence Review
  • 2004
TLDR
This paper surveys the use of Spreading Activation techniques on Semantic Networks in Associative Information Retrieval and critically analyzed a number of works in this area to study the relevance of Sp spreading Activation for associative IR.
Toward alternative metrics of journal impact: A comparison of download and citation data
RETRIEVING DOCUMENTS BY CONSTRAINED SPREADING ACTIVATION ON AUTOMATICALLY CONSTRUCTED HYPERTEXTS
Projections are provided on capacitor tabs to provide spacing between the capacitor body and seal member for gas expansion, thus eliminating the spacing plug commonly used.
FORMULATING THE PROBLEM OF PROBLEM-FORMULATION
It is argued that in order to tackle a complex problem domain the first thing to do is to construct a well-structured problem formulation, i.e. a "representation". Representations are analysed as…
Ranking complex relationships on the semantic Web
TLDR
A flexible ranking approach to identify interesting and relevant relationships in the semantic Web and the authors demonstrate the scheme's effectiveness through an empirical evaluation over a real-world data set.
Social Decision Making with Multi-Relational Networks and Grammar-Based Particle Swarms
  • Michael A. Rodriguez
  • Computer Science
    2007 40th Annual Hawaii International Conference on System Sciences (HICSS'07)
  • 2007
TLDR
This paper presents a multi-relational network ontology and grammar-based particle swarm algorithm capable of aggregating the decisions of millions of individuals and supports a diverse problem space and a broad range of vote aggregation algorithms.
...
...