text:
@inproceedings{10.1145/1988688.1988690,
author = {Hendler, James},
title = {The Semantic Web 10th Year Update},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988690},
doi = {10.1145/1988688.1988690},
abstract = {This talk is based on the fact that the Scientific American article by Tim Berners-Lee, Ora Lassila and James Hendler was published on May 21, 2001. The WIMS'11 conference is an appropriate event to reflect on the 10 years - successes and misses.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {1},
numpages = {3},
keywords = {open data, semantic web, web, linked data},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988691,
author = {Ram, Ashwin and Ai, Hua and Ram, Preetha and Sahay, Saurav},
title = {Open Social Learning Communities},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988691},
doi = {10.1145/1988688.1988691},
abstract = {With the advent of open education resources, social networking technologies and new pedagogies for online and blended learning, we are in the early stages of a significant disruption in current models of education. The disruption is fueled by a staggering growth in demand. Open Social Learning systems open a new venue for self-motivated learners to access high quality learning materials. In this paper, we describe our vision of open social learning and introduce a cyber-infrastructure that supports a large-scale open social learning community in order to facilitate self-guided learning.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {2},
numpages = {6},
keywords = {social learning},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@dataset{10.1145/review-1988688.1988691_R47156,
author = {Hazeltine, Barrett},
title = {Review ID:R47156 for DOI: 10.1145/1988688.1988691},
publisher = {Association for Computing Machinery},
url = {https://doi.org/10.1145/review-1988688.1988691_R47156}
}

@inproceedings{10.1145/1988688.1988692,
author = {Mika, Peter},
title = {Making Things Findable: Semantics for Web Search and Online Media},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988692},
doi = {10.1145/1988688.1988692},
abstract = {The publishing of original content on the Web and later, Web search have developed into two of the most profitable sources of business on the Web, supported by revenue from display advertizing and search advertizing, respectively. Despite a traditional separation, what we can observe on the Web today is a gradual blurring of the lines between these two businesses as search engines gradually integrate more and more structured content, and online publishers turn to methods of search for customizing user experiences. This brings both opportunities and a new set of challenges in applying semantic technologies.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {3},
numpages = {2},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988693,
author = {Auer, S\"{o}ren},
title = {Creating Knowledge out of Interlinked Data: Making the Web a Data Washing Machine},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988693},
doi = {10.1145/1988688.1988693},
abstract = {Over the past 4 years, the semantic web activity has gained momentum with the widespread publishing of structured data as RDF. The Linked Data paradigm has therefore evolved from a practical research idea into a very promising candidate for addressing one of the biggest challenges in the area of the Semantic Web vision: the exploitation of the Web as a platform for data and information integration. To translate this initial success into a world-scale reality, a number of research challenges need to be addressed: the performance gap between relational and RDF data management has to be closed, coherence and quality of data published on the Web have to be improved, provenance and trust on the Linked Data Web must be established and generally the entrance barrier for data publishers and users has to be lowered. We discuss approaches for tackling these challenges and their integration into a mutual refinement cycle - the linked data 'washing machine'.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {4},
numpages = {8},
keywords = {semantic web, linked data, data web},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988694,
author = {Grobelnik, Marko},
title = {Many Faces of Text Processing},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988694},
doi = {10.1145/1988688.1988694},
abstract = {Why people process text with computers? It all started many years ago, with the main goal in minds of researchers, to understand the text. In the meantime, the area of text processing developed in many different directions whereby the original goals were often forgotten. Funny enough, it seems, in several decades of computerized processing of textual data, the solution to the 'text understanding' problem didn't evolve much compared to some other, easier and often more profitable problems to deal with (such as information retrieval/search, machine translation or information extraction). In this paper we touch various aspects of text processing along several dimensions: (a) how we represent the textual data, (b) what kind of algorithms and techniques we use, and (c) what kind of problems we solve on the top of text. Finally, it is interesting to observe various research communities dealing with textual data in different ways. Most of them are still rather fragmented and don't learn enough from each other - many of the ideas developed within one community don't cross borders of that community for too long.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {5},
numpages = {3},
keywords = {text processing algorithms, text representation, text understanding, natural language processing, text processing research communities},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988696,
author = {Turhan, Anni-Yasmin},
title = {Description Logic Reasoning for Semantic Web Ontologies},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988696},
doi = {10.1145/1988688.1988696},
abstract = {The ontology language for the semantic web OWL provides means to describe entities of an application domain in an ontology in a well-structured way. The underlying formalism for OWL are Description Logics (DLs) [6], which are a family of knowledge representation formalisms that have formal semantics. This family of logics is tailored towards representing terminological knowledge of an application domain in a structured and formally well-understood way.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {6},
numpages = {5},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988697,
author = {Hausenblas, Michael},
title = {Utilising Linked Open Data in Applications},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988697},
doi = {10.1145/1988688.1988697},
abstract = {Over the past years, the Linked Data principles have successfully been applied, resulting in the Linked Open Data (LOD) cloud with over 200 datasets containing 26 billion statements, connected by 400 million typed links. Publishing into the LOD cloud is certainly a challenge, however various tutorials and guidelines exist.This tutorial addresses the consumption part, that is, it gives an introduction how to use data from the LOD cloud in Web applications. We start with simple access methods (follow-your-nose, using dumps) over querying LOD data using SPARQL, to client-side access in the browser (using JavaScript) as well as show the integration steps into a popular Content Management System (Drupal).},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {7},
numpages = {4},
keywords = {web of data, linked data, applications, consumption},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988698,
author = {Di Maio, Paola},
title = { 'Just Enough' Ontology Engineering},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988698},
doi = {10.1145/1988688.1988698},
abstract = {This paper introduces 'just enough' principles and 'systems engineering' approach to the practice of ontology development to provide a minimal yet complete, lightweight, agile and integrated development process, supportive of stakeholder management and implementation independence.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {8},
numpages = {10},
keywords = {systems science, ontology},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988700,
author = {Hu, Yuh-Jong and Yang, Jiun-Jan},
title = {A Semantic Privacy-Preserving Model for Data Sharing and Integration},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988700},
doi = {10.1145/1988688.1988700},
abstract = {In this paper, we encompass and extend previous ontology-based data integration system. A semantic privacy-preserving model provides authorized view-based query answering over a widespread multiple servers for data sharing and integration. The combined semantics-enabled privacy protection policies are used to empower the data integration and access control services at the virtual platform (VP). The ontology mapping and merging algorithm with a local-as-view (LAV) source description that creates a global ontology schema at the VP by integrating multiple local ontology schemas for data sharing. The perfect rules integration of datalog rules enforces the data query and protection services. Semantics-enable policies are combined together at the VP, but the access control criteria specified in each server are still satisfied. Therefore the soundness and completeness of data sharing and protection criteria are ensured to support the validity of policy combination. This guarantees the trustworthiness of data sharing and protection services in multiple servers.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {9},
numpages = {12},
keywords = {ontology and rule, query rewriting, data sharing and integration, semantics-enabled policy, privacy protection, semantic web, database, www},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988701,
author = {Goossen, Frank and IJntema, Wouter and Frasincar, Flavius and Hogenboom, Frederik and Kaymak, Uzay},
title = {News Personalization Using the CF-IDF Semantic Recommender},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988701},
doi = {10.1145/1988688.1988701},
abstract = {When recommending news items, most of the traditional algorithms are based on TF-IDF, i.e., a term-based weighting method which is mostly used in information retrieval and text mining. However, many new technologies have been made available since the introduction of TF-IDF. This paper proposes a new method for recommending news items based on TF-IDF and a domain ontology. It is demonstrated that adapting TF-IDF with the semantics of a domain ontology, resulting in Concept Frequency - Inverse Document Frequency (CF-IDF), yields better results than using the original TF-IDF method. CF-IDF is built and tested in Athena, a recommender extension to the Hermes news personalization framework. Athena employs a user profile to store concepts or terms found in news items browsed by the user. The framework recommends new articles to the user using a traditional TF-IDF recommender and the CF-IDF recommender. A statistical evaluation of both methods shows that the use of an ontology significantly improves the performance of a traditional recommender.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {10},
numpages = {12},
keywords = {semantic web, user profiling, recommender systems, news personalization, content-based recommender, ontology},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988702,
author = {Elia, Annibale and Postiglione, Alberto and Monteleone, Mario and Monti, Johanna and Guglielmo, Daniela},
title = {CATALOGA®: A Software for Semantic and Terminological Information Retrieval},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988702},
doi = {10.1145/1988688.1988702},
abstract = {One of the most relevant problems with Information Retrieval (IR) softwares is the correct processing of complex lexical units, today also known as multiword units. The shortcomings are mainly due to the fact that such units are often considered as extemporaneous combinations of words retrievable by means of statistical routines. On the contrary, several linguistic studies, also dating back to the '60s, show that multiword units, and mainly compound nouns, are almost always fixed meaning units, with specific formal, morphological, grammatical and semantic characteristics. Furthermore, these units can be processed as dictionary entries, thus becoming concrete lingware tools useful to achieve efficient semantic information retrieval (IR).Therefore, in this paper we will focus on CATALOGA®, an automatic IR software which retrieves terminological information from digitized texts without any human intervention. CATALOGA® is actually configured as a stand-alone software which can be integrated in Web sites and portals to be used online. More specifically, we will describe its lingware and software characteristics, discussing their usage as a possible solution to current IR software limitations. The analytical procedure here described will prove itself appropriate for any type of digitized text, and will also represent a relevant support for the building and implementing of Semantic Web (SW) interactive platforms.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {11},
numpages = {9},
keywords = {terminological information retrieval, automatic textual analysis, CATALOGA®, data mining, semantic web, lexicon-grammar, text mining},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988703,
author = {Engonopoulos, Nikos and Lazaridou, Angeliki and Paliouras, Georgios and Chandrinos, Konstantinos},
title = {ELS: A Word-Level Method for Entity-Level Sentiment Analysis},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988703},
doi = {10.1145/1988688.1988703},
abstract = {We introduce ELS, a new method for entity-level sentiment classification using sequence modeling by Conditional Random Fields (CRF). The CRF is trained to identify the sentiment of each word in a document, which is then used to determine the sentiment for the entity, based on where it appears in the text. Due to its sequential nature, the CRF classifier performs better than the common bag-of-words approaches, especially when we target the local sentiment in small parts of a larger document. Identifying the sentiment about a specific entity, mentioned in a blog post or a larger product review, is a special case of such local sentiment classification. Furthermore, the proposed approach performs well even in short pieces of text, where bag-of-words approaches usually fail, due to the sparseness of the resulting feature vector. We have implemented and tested the proposed method on a publicly available benchmark corpus of short product reviews in English. The results that we present in this paper improve significantly upon published results on the same data, thus confirming our intuition about the approach.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {12},
numpages = {9},
keywords = {pattern discovery, statistical sequence modeling, opinion mining, sentiment classification, fine-grained sentiment analysis},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988704,
author = {Furche, Tim and Gottlob, Georg and Grasso, Giovanni and Guo, Xiaonan and Orsi, Giorgio and Schallhart, Christian},
title = {Real Understanding of Real Estate Forms},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988704},
doi = {10.1145/1988688.1988704},
abstract = {Finding an apartment is a lengthy and tedious process. Once decided, one can never be sure not to have missed an even better offer which would have been just one click away. Form understanding is key to automatically access and process all the relevant---and nowadays readily available---data.We introduce opal (ontology-based web pattern analysis with logic), a novel, purely logical approach to web form understanding: opal labels, structures, and groups form fields according to a domain-specific ontology linked through phenomenological rules to a logical representation of a DOM. The phenomenological rules describe how ontological concepts appear on the web; the ontology formalizes and structures common patterns of web pages observed in a domain. A unique feature of opal is that all domain-independent assumptions about web forms are represented in rules, whereas domain-specific assumptions are represented in the ontology. This yields a coherent logical framework, robust in face of changing web trends.We apply opal to a significant, randomly selected sample of UK real estate sites, showing that straightforward rules suffice to achieve high precision form understanding.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {13},
numpages = {12},
keywords = {data extraction, web page phenomenology, deep web, form understanding},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988705,
author = {Wanner, Franz and Ramm, Thomas and Keim, Daniel A.},
title = {ForAVis: Explorative User Forum Analysis},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988705},
doi = {10.1145/1988688.1988705},
abstract = {User generated textual content on the internet has become increasingly valueable during the past few years. Forums, blogs, twitter and other social media websites are accessible for a huge amount of people all over the world. Hence, methods and tools are needed to handle this vast bulk of textual data. In this paper we present an explorative forum analysis system helping various stakeholders to cope with the task analyzing user generated content in online forums. The used mobile communication forums picture an example of user generated content in online discussion forums.Central to our system is a flexible visualization, which supports the analysis and exploration visually. Flexible means, that the ordering and the mapping of colors can be interactively changed by the analyst and the visualization is also capable to show the different structural levels of a user forum. The filter area offers beside well-known features many interesting features with respect to forum analysis, which we introduce in this paper. A detailed view of the particularly selected thread in the main visualization is presented in a third area. For a convenient manipulation and interaction we implemented intuitive mechanism. We describe the system and present various fictive user scenarios of different typical stakeholder tasks to illustrate the benefit of the system.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {14},
numpages = {10},
keywords = {user generated content, social media analysis, visual analytics, application, forum visualization, forum analysis},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988706,
author = {Karlsen, Randi and Jakobsen, B\o{}rge},
title = {The InfoAlbum Image Centric Information Collection},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988706},
doi = {10.1145/1988688.1988706},
abstract = {This paper presents a prototype of an image centric information album, where the goal is to automatically provide the user with information about i) the object or event depicted in an image, and ii) the surrounding where the image was taken. The system, called InfoAlbum, aims at improving the image viewing experience by presenting supplementary information such as location names, tags, temperature at image capture time, placement on map, geographically nearby images, Wikipedia articles and web pages. The information is automatically collected from various sources on the Internet based on the image metadata gps coordinates, date/time of image capture and a category keyword provided by the user. Collected information is presented to the user, and some is also stored in the EXIF header of the image and can later be used during image retrieval.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {15},
numpages = {9},
keywords = {image metadata, image centric information collection, information retrieval},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988708,
author = {Shi, Hui and Maly, Kurt and Zeil, Steven and Zubair, Mohammad},
title = {Comparison of Ontology Reasoning Systems Using Custom Rules},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988708},
doi = {10.1145/1988688.1988708},
abstract = {In the semantic web, content is tagged with "meaning" or "semantics" that allows for machine processing when implementing systems that search the web. General question/answer systems that are built on top of reasoning and inference face a number of difficult issues. In this paper we analyze scalability issues in the context of a question/answer system (called ScienceWeb) in the domain of a knowledge base of science information that has been harvested from the web. In ScienceWeb we will be able to answer questions that contain qualitative descriptors such as "groundbreaking", "top researcher", and "tenurable at university x". ScienceWeb is being built using ontologies, reasoning systems and custom based rules for the reasoning system. In this paper we address the scalability issue for a variety of supporting systems for ontologies and reasoning. In particular, we study the impact of using custom inference rules that are needed when processing queries in ScienceWeb.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {16},
numpages = {9},
keywords = {custom rules, ontology reasoning system, ontology, semantic web},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988709,
author = {Omitola, Tope and Zuo, Landong and Gutteridge, Christopher and Millard, Ian C. and Glaser, Hugh and Gibbins, Nicholas and Shadbolt, Nigel},
title = {Tracing the Provenance of Linked Data Using VoiD},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988709},
doi = {10.1145/1988688.1988709},
abstract = {In the open world of the (Semantic) web, a world where increasingly diverse materials from disparate sources of different qualities are being made available, an automatic mechanism for the provision of provenance information of these sources is needed. This paper describes voidp, a provenance extension for the void vocabulary, that allows data publishers to specify the provenance relationships of their data. We enumerate voidp's classes and properties, and describe a use case scenario. A wider uptake of voidp by dataset publishers will allow data consuming tools to take advantage of these metadata providing consumers with the origin, i.e., the provenance, of what is being consumed.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {17},
numpages = {7},
keywords = {lineage, provenance, web science, linked data},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988710,
author = {Garc\'{\i}a, Roberto and Brunetti, Josep Maria and L\'{o}pez-Muz\'{a}s, Antonio and Gimeno, Juan Manuel and Gil, Rosa},
title = {Publishing and Interacting with Linked Data},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988710},
doi = {10.1145/1988688.1988710},
abstract = {In order to make a Semantic Web dataset more usable to a wider range of users, specially Linked Data ones, Rhizomer constitutes a tool for data publishing in the web that in addition to common data browsing mechanisms based on HTML rendering, provides a set of components that facilitate awareness of the dataset at hand borrowed from Information Architecture. Rhizomer automatically generates navigation menus taking into account the ontologies used by the dataset and facets based on how properties are instantiated for each of the classes in the dataset. This makes it possible for users to easily be aware of the main kinds of things in the dataset but also their main properties and the values the take while they perform faceted navigation. These generic IA components are complemented with specialised interaction services that can be dynamically deployed and associated to resource using semantic web services. Among these services, Rhizomer features one that provides simple edition of the data using autocomplete forms guided by the ontologies used in the dataset and the available resources.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {18},
numpages = {12},
keywords = {usability, linked data, ontology, metadata, semantic web, visualisation, human-computer interaction},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988711,
author = {Paulheim, Heiko},
title = {Improving the Usability of Integrated Applications by Using Interactive Visualizations of Linked Data},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988711},
doi = {10.1145/1988688.1988711},
abstract = {Today, data is contained in many different, heterogeneous information systems. For turning that data into valuable information, those systems need to be integrated. System integration on the user interface level, e.g., in portals or mashups, allows users to access multiple applications in parallel and explore the information contained therein while reusing familiar and powerful user interfaces. Linked data can significantly add value by allowing uniform access to the data contained in the systems, and by letting reasoners discover hidden, non-explicit knowledge from that data.In this paper, we present an approach combining both paradigms. A framework for integrating user interfaces is enhanced by the Semantic Data Explorer, which is interlinked with the integrated applications in a hybrid view. With a quantitative user study conducted in the emergency management area, we show that hybrid visualizations of annotated data help gathering information from integrated systems, even for users who are not trained with ontologies and semantic networks.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {19},
numpages = {12},
keywords = {linked data, visualization, user experience, user interface integration},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988712,
author = {Di Maio, Paola},
title = {Toward a Semantic Vocabulary for Systems Engineering},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988712},
doi = {10.1145/1988688.1988712},
abstract = {The web can be the most efficient medium for sharing knowledge, provided appropriate technological artifacts such as controlled vocabularies and metadata are adopted. In our research we study the degree of such adoption applied to the systems engineering domain. This paper is a work in progress report discussing issues surrounding knowledge extraction and representation, proposing an integrated approach to tackle various challenges associated with the development of a shared vocabulary for the practice.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {20},
numpages = {8},
keywords = {wiki, vocabulary, semantic, systems engineering, ontology},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988713,
author = {Solovyev, Valery and Zhiltsov, Nikita},
title = {Logical Structure Analysis of Scientific Publications in Mathematics},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988713},
doi = {10.1145/1988688.1988713},
abstract = {Even though the Linking Open Data cloud is constantly growing, there is a serious lack of published data sets related to the domain of academic mathematics. At the same time, since most scholarly publications in mathematics are well-structured and conventional, it's promising to get their helpful detailed representation. The paper describes an approach to extracting and analyzing the structure of mathematical papers. We present the Mocassin ontology that is used by analysis algorithms and can be considered as an ontology of the structure of scholarly publications in mathematics. The proposed semantic model has been evaluated on a set of real mathematical papers and preliminary evaluation results are encouraging. Also we discuss potential applications of the model to specific information retrieval tasks including semantic search.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {21},
numpages = {9},
keywords = {linked data, ontology, document structure analysis},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988714,
author = {Kleb, Joachim and Abecker, Andreas},
title = {Disambiguating Entity References within an Ontological Model},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988714},
doi = {10.1145/1988688.1988714},
abstract = {In our everyday conversations, entities (persons, companies, etc.) are referred to by natural language identifiers (NLIs). Humans employ personal experience and situational context to interpret such identifiers. However, due to ambiguity, even humans run the risk of misinterpretations. In our prior work, we presented a novel method to resolve entity references in texts under the aspect of ambiguity. We explore ontological background knowledge represented in an RDF(S) graph. The different interpretation possibilities lead to different subgraphs of the underlying ontology, each subgraph describing one consistent, non-ambiguous interpretation of the ambiguous NLIs within the ontological knowledge base. Our domain-independent approach is based on spreading activation and uses a semantic relational ranking. In this paper, we suggest three extensions to our original algorithm. First, we process in a two-step interpretation---instead of the whole original input text---at first hand smaller text windows in order to get more precise reference interpretations through a smaller local text context. Second, we extend the spreading-activation algorithm within the RDF(S) graph towards a bidirectional exploration of edges which shall speed-up the algorithm. Third we use reinforcement learning in order to take advantage of re-occurring information. We present first experimental results with these algorithmic extensions and derive directions for future work.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {22},
numpages = {11},
keywords = {spreading activation, named entity, graph},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988716,
author = {Ilie, Sorin and B\u{a}dic\u{a}, Amelia and B\u{a}dic\u{a}, Costin},
title = {Distributed Agent-Based Ant Colony Optimization for Solving Traveling Salesman Problem on a Partitioned Map},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988716},
doi = {10.1145/1988688.1988716},
abstract = {In this paper we discuss the experimental evaluation of an improved configuration of our recent framework ACODA (Ant Colony Optimization on a Distributed Architecture) for solving the Traveling Salesman Problem (TSP). ACODA is a novel multi-agent system architecture for distributed Ant Colony Optimization in a decentralized environment. This new configuration improves the execution time by allowing each software agent of ACODA to manage a part of the TSP map rather than a single map node. Experimental results support this claim of improved efficiency while showing that the scalability of the system is preserved.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {23},
numpages = {9},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988717,
author = {Alcic, Sadet and Conrad, Stefan},
title = {Page Segmentation by Web Content Clustering},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988717},
doi = {10.1145/1988688.1988717},
abstract = {Web page segmentation is an important task with benefits for a variety of applications, reaching from data extraction to accessibility improvement. Focusing on the smallest content units of a web page, page segmentation can be reduced to a clustering of web contents to structural and semantical cohesive groups. To investigate the web page segmentation task from the clustering point of view, we define three possible distance measures for content units based on their DOM, geometric and semantic properties. We combine these distance measures with common clustering techniques and evaluate the web page segmentation accuracy on a labelled collection by applying widely used validity measures.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {24},
numpages = {9},
keywords = {web content distance, web content clustering, web page segmentation},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988718,
author = {Orgaz, Gema Bello and Cajias, Raul and Camacho, David},
title = {A Study on the Impact of Crowd-Based Voting Schemes in the 'Eurovision' European Contest},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988718},
doi = {10.1145/1988688.1988718},
abstract = {The Eurovision contest has been the reference on european song contests for the past 50 years. Countries in the European Union can shows the rest of the participants their current music tendencies. This phenomena has been studied in domains like physic and social sciences to find correlations between contests and current political and socio-economy trends in EU. The inclusion of web and social technologies some years ago, have caused a disruption in the traditional voting system whereby the audience is encouraged to participate by casting votes for their favorite song. As a result, this system yields new, relevant information that may be extrapolated to social and political tendencies in Europe with a higher degree accuracy than by data collected using the previous jury-based system. This paper provides an initial data analysis in crowd behavior to assess the impact of the televote system, in the Eurovision voting dynamic, by focusing on two distinct five years periods that can successfully contrast each voting scheme. Analyzing these periods separately, we can observe results from the televoting contests and then compare to the jury to see if there is a change in voting patterns. Finally, we study the underlying community structure of the voting network using the Cluster Percolation Method and Edge Betweenness to discover stable core communities spanning a number of years in the contest. The clusters obtained using these algorithms are then used to compare how these stable communities have evolving during the considered periods.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {25},
numpages = {9},
keywords = {CPM, televoting, graph based algorithms, voting partnership, network, data mining, eurovision, web mining, social mining, edge betweenness},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988719,
author = {Yusof, Mohd Kamir and Abidin, Ahmad Faisal Amri and Usop, Surayati and Deris, Sufian Mat},
title = {Designing an Architecture for Improving Web Query Processing in Heterogeneous Databases Access},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988719},
doi = {10.1145/1988688.1988719},
abstract = {World Wide Web is important tool to web users. This tool enables the web users gain information about education, entertainment, etc. In this research, we investigate the issue for data access to heterogeneous data sources. Web query processing is issue for access the heterogeneous data sources. In this research, new architecture for improving web query processing in heterogeneous databases was presented. In this architecture components such initial query, exploit query, refinement query and match query is implemented in order to improve web query processing. Meanwhile, new algorithm designed to support this architecture. Based on approaches above, we also present architecture and prototype of a system for heterogeneous database access.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {26},
numpages = {6},
keywords = {web query processing, linguistic, heterogeneous database, semantic, data warehouse},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988720,
author = {Drury, Brett and Almeida, J. J.},
title = {Identification of Fine Grained Feature Based Event and Sentiment Phrases from Business News Stories},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988720},
doi = {10.1145/1988688.1988720},
abstract = {The analysis of business/financial news has become a popular area of research because of the possibility to infer the future prospects of companies, economies and economic actors in general on information contained in the media. The classical approaches rely upon a "coarse" polarity classification of a news story, however this may not be an optimal solution because this form of classification assigns the same polarity to all of the entities contained in the news story. A news story which contains multiple entities may contain varying polarity for each individual entity. In addition,"coarse" classification may ignore sentiment modifiers which may alter the strength or direction of the story's polarity. News stories don't have a preassigned polarity label, consequently news stories must be manually assigned a polarity label. This process is slow, therefore there will be limited labelled data available. This lack of pre-classified data may inhibit the performance of learners which rely upon labelled data.This paper describes a rule based approach which identifies feature based sentiment and business event phrases. The phrases are captured with context free grammars which model the phrase as a triple. The triple contains: 1. Phrase subject (an economic actor), 2. A sentiment adjective or event verb and 3. An object (a property of the phrase subject). The captured phrases are limited by the semantic role of the subject. An annotated phrase can capture sentiment modifiers and negators. The scoring of the phrase incorporates all relevant linguistic features and consequently an accurate individual polarity score can be assigned to each relevant entity. The evaluation of the technique reports a recall of 0.71 and precision of 0.94 sentiment phrase annotation and 0.84 recall and 0.83 precision for event phrase annotation.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {27},
numpages = {7},
keywords = {sentiment detection, RSS, web intelligence, linguistic patterns, news, business, event detection},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988721,
author = {Shabib, Nafiseh and Krogstie, John},
title = {The Use of Data Mining Techniques in Location-Based Recommender System},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988721},
doi = {10.1145/1988688.1988721},
abstract = {Due to exponential growth of available information about products, users face problems when trying to identify products of interest. Because of this there is a need to design systems to help users select products more tailored to their interests through recognition of users' behavior. In the present paper, by using data mining techniques and making clustering model, the users with similar preferences were recognized and provided with appropriate recommendations. These recommendations were not only personalized on the basis of customer's behavior but also by considering user's location. MovieLens, a movie recommendation site, was used for model assessment. The results of the assessment showed that the method presented in this paper has a good accuracy for prediction of users' preferences.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {28},
numpages = {7},
keywords = {data mining, recommender system, context-aware},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988722,
author = {Hawalah, Ahmad and Fasli, Maria},
title = {A Graph-Based Approach to Measuring Semantic Relatedness in Ontologies},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988722},
doi = {10.1145/1988688.1988722},
abstract = {The need of determining the degree of semantic similarity, relatedness or distance between two concepts within the same ontology or two different ontologies is becoming an increasingly important task in the field of Information Retrieval. Although a great attention has been paid to design semantic similarity/relatedness methods based on taxonomies, there has been little discussion about the design of semantic similarity/relatedness methods based on ontologies. In this paper we introduce a novel graph-based semantic relatedness approach to calculate semantic relatedness considering both hierarchical and non-hierarchical concepts in an ontology. In addition, our approach considers some important properties such as different relation types, concepts' depth and distance that play an essential role in measuring semantic relatedness. Three experimental studies are provided to first illustrate that our approach give a different results than other measures in the literature. Then, we compare our approach against existed methods using a benchmark dataset, and finally, evaluate our approach by using a real ontology and compare the predictions of our semantic relatedness approach against the human-subject judgment. The results in all the experiments show a considerable improvement against traditional taxonomy-based measures.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {29},
numpages = {12},
keywords = {semantic relatedness, web mining, ontology, semantic similarity},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988723,
author = {Kumar, Ritesh},
title = {A Register-Based Annotation Scheme for CO3H},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988723},
doi = {10.1145/1988688.1988723},
abstract = {This paper gives a description of an annotation scheme for annotating a corpus of computer-mediated communication in Hindi (CO3H) with certain semantic, pragmatic and situational features. The annotation scheme is based on the theory of register analysis, where it is assumed that a registeral difference entails difference in certain linguistic features. It adapts and integrates the annotation schemes of sense annotation in the Penn Discourse Treebank and dialogue act annotation of DIT++ within this larger registeral framework. The situational and linguistic features that will be used to annotate the corpus for PoRT is described in the paper, along with some proposed labels for these features.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {30},
numpages = {12},
keywords = {register analysis, CMC annotation, CO3H, PoRT, annotation},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988725,
author = {Elia, Annibale and Vellutino, Daniela and Marano, Federica and Langella, Alberto Maria and Napoli, Antonella},
title = {Semantic Web and Language Resources for E-Government: Linguistically Motivated Data Mining},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988725},
doi = {10.1145/1988688.1988725},
abstract = {Language Technologies (LT) perform well when they rely on a previous Language Resources (LR) development. Hence, in this paper we illustrate how to build an efficient data mining system based on a coherent formalization of natural language and on a lingware (in Machine-Readable Form) built on the universal concepts of "lexical unit", "meaning unit" and "morphosyntactic context". From a linguistic and semantic point of view we get more coherent results through a linguistically motivated data mining than a statistical approach. We developed LR for Natural Language Processing (NLP) applications, composed by electronic dictionaries made of terminological multiword-expressions (Machine-Readable Form) and by local grammars (in the form of finite-state automata and transducers -- FSA/FST). Both parts of this lingware were built and applied according to Lexicon-Grammar (LG) formalization principles and methods. The mentioned language resources form the basis to develop an Information Retrieval System for e-Government. This device is a Semantic Web (SW) application, which will automatically recognize a given set of frequently-asked questions (from here on, FAQs) on European Community Information, previously formalized as syntactic patterns inside local grammars.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {31},
numpages = {9},
keywords = {IR, multiword-expressions, electronic dictionaries, linguistic resources, NLP, semantic web, finite state automata, local grammars, data mining},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988726,
author = {Descl\'{e}s, Julien and Makkaoui, Olfa and Descl\'{e}s, Jean-Pierre},
title = {Towards Automatic Thematic Sheets Based on Discursive Categories in Biomedical Literature},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988726},
doi = {10.1145/1988688.1988726},
abstract = {Biological papers contain a huge amount of results and ideas that are difficult to manage. Researchers are not only interested in finding relevant information but they also need to know how the authors of papers get the results. Thus, it is interesting to identify the methods used and to distinguish for example between speculations, observations and deductions. Biologists need also to distinguish between new and prior information, especially to identify the real new output of a study. In order to respond to these needs, we propose a linguistic model based on the discursive categories. This model aims to develop the BioExcom tool for the automatic production of thematic sheets using the Contextual Exploration processing. BioExcom is already able to detect speculative sentences and to categorize them into new and prior speculation. The other categories of the model will be developed using the proposed linguistic markers.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {32},
numpages = {7},
keywords = {automatic annotation, contextual exploration, discourse analysis, categorization, summarization, biology, information extraction},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988727,
author = {Chung, Jin-Woo and Lee, Ho-Joon and Park, Jong C.},
title = {Improving Accessibility to Web Documents for the Aurally Challenged with Sign Language Animation},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988727},
doi = {10.1145/1988688.1988727},
abstract = {In this paper, we describe how to improve accessibility for the aurally challenged in a web environment, focusing on utilizing a signing avatar for web pages. Many systems were previously proposed to make a web environment more accessible for the deaf people by providing signed expressions, i.e. translating written text into sign language animations and presenting them in a proper way, based on the observation that deaf users normally have much difficulty understanding text-based information as well as audio contents. We analyze the strengths and weaknesses of these systems with respect to discussed design criteria, and propose a system that presents a signing avatar for web page documents via a mobile device, which is expected to overcome the shortcomings of the previous systems and to improve the accessibility of deaf users to textual contents in a web environment. The proposed system has three main parts based on a client-server architecture: 1) a client that executes a web browser and transmits selected text to the server, 2) a server that takes text as input and translates it into signed expressions through a sign language generation module, and 3) a mobile device that displays signing animation transmitted from the server by streaming. We also present some linguistic issues raised by the difference between Korean and Korean Sign Language. To the best of our knowledge, this is the first approach to the use of a mobile device for web document access by the aurally challenged people. We discuss implications of our study and future directions.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {33},
numpages = {8},
keywords = {web accessibility, sign language, deaf signers},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988729,
author = {Hella, Lillian and Krogstie, John},
title = {Personalisation by Semantic Web Technology in Food Shopping},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988729},
doi = {10.1145/1988688.1988729},
abstract = {Personalisation is a desired functionality for applications within mobile environments as we are moving towards a ubiquitous world. One approach to personalisation of mobile services is by the use of personal and contextual information. In this paper we describe an architecture for this purpose where we utilize ontologies. The developed ontology that covers personal information and food information is based on, and evaluated relative to, personas and scenarios from the food shopping domain. The profile covers three levels of information; personal information, long term interests and temporary interests. The proposed concept of personalisation is illustrated in two developed pull and push scenarios. The personalisation concept in the form of videos is evaluated using the Technology Acceptance Model (TAM), and the initial findings of the analysis are presented here.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {34},
numpages = {12},
keywords = {technology acceptance model, semantic web, personal profile, ontology, personalisation},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988730,
author = {Subercaze, Julien and Maret, Pierre},
title = {Virtual Knowledge Communities for Semantic Agents},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988730},
doi = {10.1145/1988688.1988730},
abstract = {Virtual Knowledge Communities are a well suited paradigm for decentralized knowldege exchanges and they have been applied in several domains. In this paper we investigate the implementation of virtual knowledge communities with semantic agents. Using the SAM (Semantic Agent Modeling) approach, we show that agents can exchange community related concepts (in OWL) and behavior (in SWRL). Agents can then learn and adapt new community-related behavior, which is usefull when changing the role or entering into a new environment. For this purpose, we formalize Virtual Knowledge Communities in a set-theoretic way and we implement this formalization in an OWL ontology. Some examples of community representation using our formalization are presented in this paper.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {35},
numpages = {9},
keywords = {virtual knowledge communities, ontology, SWRL, OWL, set-theoretic formalization, semantic agent},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988731,
author = {Moritz, Franka and Siebert, Maria and Meinel, Christoph},
title = {Improving Search in Tele-Lecturing: Using Folksonomies as Trigger to Query Semantic Datasets to Extract Additional Metadata},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988731},
doi = {10.1145/1988688.1988731},
abstract = {Tele-teaching, where recorded lectures are streamed via the internet, was identified as the easiest adoptable method to produce large amounts of e-learning content. Due to the nature of the e-learning material produced, it is lacking searchable data and metadata. Social Web technologies have been identified as one way to overcome this problem, because metadata will be generated by users. But still, the amount of metadata generated that way is not sufficient and the contextual information is missing. This information can be extracted from the Semantic Web, especially from Linked Data initiatives. This paper describes a workflow that utilizes the metadata generated by users to trigger the query of semantic datasets. These datasets are providing additional metadata, that can be extracted via an interface, which is publicly available. Thereby it is possible to supply new search strategies and achieve an extension of the search space for multimedia e-learning data. An extension of an existing search functionality and the similarity detection is finally described.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {36},
numpages = {8},
keywords = {folksonomies, tele-teaching, metadata, semantic web, community tags, linked data},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988733,
author = {Opdahl, Andreas L.},
title = {Semantic Annotations for Modelling Language Interoperability},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988733},
doi = {10.1145/1988688.1988733},
abstract = {Interoperability between model-driven software technologies can become easier to achieve if the models and modelling languages used are made interoperable too. One way to achieve interoperability is to capture the semantics of modelling language constructs and model elements by mapping them to semantic models, such as ontologies. The paper proposes a set of extensions for XML-based modelling language specifications. The extensions have the potential to work equally well for model representations. The purpose is to support fine-grained and structured semantic annotations of languages and, eventually, of models. The proposal is inspired by the Semantic Annotations for WSDL and XML (SAWSDL) recommendation and on the Unified Enterprise Modelling Language (UEML). The proposal is exemplified using the Action and ActionExecution constructs from UML 2.2.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {37},
numpages = {9},
keywords = {SAWSDL, information systems modelling, enterprise modelling, web-service modelling, unified modeling language, UML, unified enterprise modelling language, UEML, software modelling, ontology},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988734,
author = {Goodwin, Morten},
title = {A Solution to the Exact Match on Rare Item Searches: Introducing the Lost Sheep Algorithm},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988734},
doi = {10.1145/1988688.1988734},
abstract = {This paper proposes an approach for finding a single web page in a large web site or a cloud of web pages. We formalize this problem and map it to the exact match on rare item searches (EMRIS). The EMRIS is not much addressed in the literature, but many closely related problems exists. This paper presents a state-of-the-art survey on related problems in the fields of information retrieval, web page classification and directed search.As a solution to the EMRIS, this paper presents an innovative algorithm called the lost sheep. The lost sheep is specifically designed to work in web sites with of links, link texts and web pages. It works as a pre-classifier on link texts to decide if a web page is candidate for further evaluation.This paper also defines sound metrics to evaluated the EMRIS. The lost sheep outperforms all comparable algorithms both when it comes to maximizing accuracy and minimizing the number of downloaded pages.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {38},
numpages = {12},
keywords = {classification, crawling, search},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988735,
author = {Wlodarczyk, Tomasz Wiktor and Rong, Chunming and O'Connor, Marting and Musen, Mark},
title = {SWRL-F: A Fuzzy Logic Extension of the Semantic Web Rule Language},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988735},
doi = {10.1145/1988688.1988735},
abstract = {Enhancing Semantic Web technologies with ability to express uncertainty and imprecision is widely discussed topic. While SWRL can provide additional expressivity to OWL-based ontologies, it does not provide any way to handle uncertainty or imprecision. There is a pressing need to provide a standard-based, simple and functioning solution. We describe an extension of SWRL called SWRL-F that we believe can provides such a solution. SWRL-F is based on SWRL rule language and uses SWRL's strong semantic foundation as its formal underpinning. We extend it with a SWRL-F ontology to enable fuzzy reasoning in the rule base basing on the fuzzy control systems approach. The resulting language provides small but powerful set of fuzzy operations that do not introduce inconsistencies in the host ontology. We present it basing on the example of risk assessment in oil and gas industry which was a driving use case for this project.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {39},
numpages = {9},
keywords = {SWRL, fuzzy logic, SWRL-F, fuzzy, fuzzy rules, risk, rule language},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988736,
author = {Cede\~{n}o, Juan P. and Candan, K. Sel\c{c}uk},
title = {R2DF Framework for Ranked Path Queries over Weighted RDF Graphs},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988736},
doi = {10.1145/1988688.1988736},
abstract = {Resource Description Framework (RDF) is a semantic web specification that aims to support conceptual modeling of information about resources in the form of a triples of facts. In this paper, we note that, although RDF provides mechanisms to encode meta-information (such as source, trust, or certainty) about facts recorded in the knowledge base, existing RDF query languages and RDF stores fail to support key primitives needed in a large class of knowledge applications which associate utilities or costs on the available knowledge statements. To address this shortcoming, we propose a novel R2DF framework for utility ranked resource descriptions. We first propose a simple ranked RDF (R2DF) specification to enhance RDF triples with an application specific weight (e.g. cost). We then propose a SPARankQL query language specification, which includes a set of novel primitives on top of the SPARQL language to express top-k queries using traditional query patterns as well as novel flexible path predicates. An extended query processor engine, AR2Q, leverages novel index structures to support efficient ranked path search and includes query optimization strategies based on two key metrics: (a) proximity and (b) sub-result inter-arrival time. Experiments show that the use of these two metrics has significant impacts on the performance of top-k queries over R2DF graphs: in particular, the proximity measure helps reduce the number of path matches that need to be considered, whereas the inter-arrival measure reduces the overall execution time significantly especially when used along with proximity. The proposed strategies help obtain query plans close to optimal.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {40},
numpages = {12},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988737,
author = {Assel, Matthias and Cheptsov, Alexey and Gallizo, Georgina and Celino, Irene and Dell'Aglio, Daniele and Brade\v{s}ko, Luka and Witbrock, Michael and Valle, Emanuele Della},
title = {Large Knowledge Collider: A Service-Oriented Platform for Large-Scale Semantic Reasoning},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988737},
doi = {10.1145/1988688.1988737},
abstract = {Recent advances in the Semantic Web community have yielded a variety of reasoning methods used to process and exploit semantically annotated data. However, most of those methods have only been approved for small, closed, trustworthy, consistent, and static domains. Still, there is a deep mismatch between the requirements for reasoning on a Web scale and the existing efficient reasoning algorithms over restricted subsets. This paper describes the pilot implementation of LarKC -- the Large Knowledge Collider, a platform, which focuses on supporting large-scale reasoning over billions of structured data in heterogeneous data sets. The architecture of LarKC allows for an effective combination of techniques coming from different Semantic Web domains by following a service-oriented approach, supplied by sustainable infrastructure solutions.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {41},
numpages = {9},
keywords = {reasoning infrastructure, semantic web, service-oriented platform, large knowledge collider},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988738,
author = {Nikoli\'{c}, Sini\v{s}a and Penca, Valentin and Segedinac, Milan and Konjovi\'{c}, Zora},
title = {Semantic Web Based Architecture for Managing Hardware Heterogeneity in Wireless Sensor Network},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988738},
doi = {10.1145/1988688.1988738},
abstract = {Wireless Sensor Networks (WSNs) are vivid and relatively new paradigm. Usually they are built for the specific purposes which, in the case of large systems of WSNs, can result in high hardware heterogeneity. In this paper we have proposed an ontology-based model aimed at resolving the hardware heterogeneity in large systems of WSNs, and the GLOSENT architecture that facilitates integration of heterogeneous WSNs. In addition, as a case study the concrete SN device SunSPOT is represented using proposed ontology.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {42},
numpages = {9},
keywords = {SunSPOT, ontology, heterogeneity, wireless sensor networks, middleware},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988739,
author = {Kargar-Ghavi, Mahdieh and Khayyambashi, Mohammad Reza},
title = {Group Decision Making in Ontology Matching},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988739},
doi = {10.1145/1988688.1988739},
abstract = {Ontology matching tries to establish semantic relations between similar elements in different ontologies to provide interoperability in the semantic web. Dealing with the problem of semantic heterogeneity is a key point in the semantic web environment. The (semi) automatic generating of mappings with respect to uncertainty is a labor intensive and error prone task. While the confidence values of mappings themselves are uncertain, how can the aggregation method between them be certain? How can we model them in a certain manner? This paper introduces a new approach for modeling uncertainty in ontology matching on the basis of fuzzy set theory and then describes an iterative algorithm that exploits group decision making solutions to aggregate opinions of matchers into a group consensus one. Thus matching systems are combined to overcome contradictory and incomplete alignments, so that the quality and accuracy of final alignment will be improved.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {43},
numpages = {8},
keywords = {mapping aggregation, ontology matching, fuzzy set theory, decision making, semantic web},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988740,
author = {\c{S}ensoy, Murat and de Mel, Geeth and Vasconcelos, Wamberto W. and Norman, Timothy J.},
title = {Ontological Logic Programming},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988740},
doi = {10.1145/1988688.1988740},
abstract = {In this paper, we propose Ontological Logic Programming (OLP), a novel approach that combines logic programming with ontological reasoning. The proposed approach enables the use of ontological terms (i.e., individuals, classes and properties) directly within logic programs. The interpretation of these terms are delegated to an ontology reasoner during the interpretation of the program. Unlike similar approaches, OLP makes use of the full capacity of both the ontological reasoning and logic programming. We evaluate the computational properties of OLP in different settings and show that its performance can be significantly improved using caching mechanisms. Furthermore, using a case-study, we demonstrate the usefulness of OLP in real-life settings.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {44},
numpages = {9},
keywords = {semantic web, logic programming},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988741,
author = {Rizzo, Giuseppe and Fanizzi, Nicola and d'Amato, Claudia and Esposito, Floriana},
title = {Prediction of Class and Property Assertions on OWL Ontologies through Evidence Combination},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988741},
doi = {10.1145/1988688.1988741},
abstract = {In the line of our investigation of inductive methods for Semantic Web reasoning, we propose an alternative way for approximate ABox reasoning based on the evidence and the analogical principle of the nearest-neighbors. Once neighbors of a test individual are selected through some distance measures, a combination rule descending from the Dempster-Shafer theory can join together the evidence provided by the various neighbor individuals in order to predict unknown values in a learning problem. We show how to exploit the procedure in the problems of determining unknown class- and role-memberships or fillers for datatype properties which may be the basis for many further ABox inductive reasoning algorithms.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {45},
numpages = {9},
keywords = {belief, evidence theory, combination rule, plausibility, description logics, similarity, distances},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988743,
author = {Arag\'{o}n, Pablo and Garc\'{\i}a, \'{I}\~{n}igo and Garc\'{\i}a, Antonio},
title = {Graph Visualization Tool for Twittersphere Users Based on a High-Scalable Extract, Transform and Load System},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988743},
doi = {10.1145/1988688.1988743},
abstract = {Microblogging is a service emerged from Web 2.0 that allows to publish posts of limited length, generally less than 200 characters in a user profile Web page. Most of these services, like Twitter1, Jaiku2 or Tumblr3 provide the option to subscribe to other users, thereby, each post is sent immediately to those who have chosen the option of receiving them. Twitter is the most widely used microblogging system. In it, users publish updates and interact with other members by forwarding updates or quoting users in their posts by mentions or replies.The last feature makes up a large repository of Web information that includes connections between users by associating each link with a textual content. The application presented in this paper shows how to mine data through a graphical tool that identifies key influencers related to a search, and it organizes the results into a graph structure. Thereby, the final client manages a mechanism for recognizing key opinion makers in a specific subject by visualizing them as interconnected nodes..},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {46},
numpages = {4},
keywords = {microblogging, extract-transform-load processes, social media analysis, high-scalable architecture, Twitter},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988744,
author = {Lavesson, Niklas and Johnson, Henric},
title = {Measuring Profile Distance in Online Social Networks},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988744},
doi = {10.1145/1988688.1988744},
abstract = {Online Social Networks (OSNs) provide new ways for people to communicate with one another and to share content. OSNs have become quite popular among the general population but their rapid growth has raised concerns about privacy and security. Many predict that the OSNs of today provide a glimpse of the future Internet infrastructure. Whether or not that will be true is difficult to say but what is certain is that the privacy, integrity, and security issues and concerns need to be addressed now. In fact, the mainstream media have uncovered a rising number of potential and occurring problems, including: identity theft, unauthorized sharing of private information, malicious behavior of OSN services and applications, and so on. This paper addresses several important security and privacy issues by focusing on one of the core concepts of OSNs; the user profile, which both includes private and public information that the user shares to different parties and the customized security and privacy settings of the user. We present a method for comparing user profiles, by measuring the distance between the profiles in metric space, and for determining how well an OSN application conforms to user privacy settings. We report on a case study in which the proposed method is applied to Facebook to demonstrate the applicability of the method as well as to motivate its theoretical foundation.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {47},
numpages = {12},
keywords = {application, Euclidean distance, profile},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988745,
author = {Yerva, Surender Reddy and Mikl\'{o}s, Zolt\'{a}n and Aberer, Karl},
title = {What Have Fruits to Do with Technology? The Case of Orange, Blackberry and Apple},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988745},
doi = {10.1145/1988688.1988745},
abstract = {Twitter is a micro-blogging service on the Web, where people can enter short messages, which then become visible to other users of the service. While the topics of these messages varies, there are a lot of messages where the users express their opinions about companies or products. Since the twitter service is very popular, the messages form a rich source of information for companies. They can learn with the help of data mining and sentiment analysis techniques, how their customers like their products or what is the general perception of the company. There is however a great obstacle for analyzing the data directly: as the company names are often ambiguous, one needs first to identify, which messages are related to the company. In this paper we address this question. We present various techniques to classify tweet messages, whether they are related to a given company or not, for example, whether a message containing the keyword "apple" is about the company Apple Inc.. We present simple techniques, which make use of company profiles, which we created semi-automatically from external Web sources. Our advanced techniques take ambiguity estimations into account and also automatically extend the company profiles from the twitter stream itself. We demonstrate the effectiveness of our methods through an extensive set of experiments.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {48},
numpages = {10},
keywords = {entity resolution, entity profiles, web mining, Twitter classification, ambiguity estimation, Twitter message stream},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988746,
author = {Crampes, Michel and Planti\'{e}, Michel},
title = {Mining Social Networks and Their Visual Semantics from Social Photos},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988746},
doi = {10.1145/1988688.1988746},
abstract = {With the new possibilities in communication and information management, social networks and photos have received plenty of attention in the digital age. But there has been little research about the possibility that social photos carry some implicit social information and about the capacity to use this information for mining social data. In this paper, we show how social photos, captured during family or friends' events, representing individuals or groups, can be used to build social networks and express part of their semantics. Our contribution takes a wedding as an example. We present a method with different facets which give different results. The resulting social networks can be used by people as a mirror of the event and also as a means for sharing photos with personalized albums.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {49},
numpages = {10},
keywords = {Galois latice, formal concept analysis, graph theory, social tribe, hypergraphs, social networks, social photos},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988747,
author = {Skopik, Florian and Schall, Daniel and Dustdar, Schahram},
title = {Managing Social Overlay Networks in Semantic Open Enterprise Systems},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988747},
doi = {10.1145/1988688.1988747},
abstract = {Cross-enterprise collaboration has emerged as a key survival factor in today's global markets. Semantic Web technologies are the basis to establish enterprise interoperability including data mediation support and automatic composition of services. Capabilities of services are semantically described and reasoning techniques support the discovery and selection of services at run-time. These technologies are commonly based on precisely defined enterprise ontologies. In contrast to Semantic Web technologies that cover interactions between (technical) services, human collaborations emerge based on social preferences. Social networks have become a mass phenomenon. The fundamental aspects of these networks are to manage personal contacts and to share profile information with friends. These principles are increasingly harnessed in businesses and professional environments. In a manner similar to service-oriented systems, they enable flexible discovery and dynamic collaborations between participants. In this paper, we discuss the concept of social overlays for Web service based collaboration infrastructures. This mechanism enables information flows between actors in order to allow for flexible group formations in highly dynamic large-scale networks.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {50},
numpages = {12},
keywords = {semantic service-oriented collaboration, social networks, formation},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988748,
author = {Maamar, Zakaria and Faci, Noura and Badr, Youakim and Wives, Leandro Krug and dos Santos, P\'{e}dro Bispo and Benslimane, Djamal and de Oliveira, Jos\'{e} Palazzo Moreira},
title = {Towards a Framework for Weaving Social Networks Principles into Web Services Discovery},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988748},
doi = {10.1145/1988688.1988748},
abstract = {This paper presents a framework for weaving the principles (or metaphor) of social networks into Web services with emphasis on supporting their discovery. Despite the regular updates of the existing discovery techniques, the discovery of Web services continues to exacerbate users due to the large number of available Web services on the Internet. Different needs trigger the discovery of Web services such as developing new, value-added composite services and sustaining the high availability of other peers. These needs reveal three types of relationships between Web services, which are substitution, competition, and collaboration. The proposed framework includes tools that capture these relationships into social networks so that Web services discovery can be made smooth. Some implementation and simulation details are, also, discussed in this paper.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {51},
numpages = {11},
keywords = {discovery, social network, web service},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988749,
author = {Catanese, Salvatore A. and De Meo, Pasquale and Ferrara, Emilio and Fiumara, Giacomo and Provetti, Alessandro},
title = {Crawling Facebook for Social Network Analysis Purposes},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988749},
doi = {10.1145/1988688.1988749},
abstract = {We describe our work in the collection and analysis of massive data describing the connections between participants to online social networks. Alternative approaches to social network data collection are defined and evaluated in practice, against the popular Facebook Web site. Thanks to our ad-hoc, privacy-compliant crawlers, two large samples, comprising millions of connections, have been collected; the data is anonymous and organized as an undirected graph. We describe a set of tools that we developed to analyze specific properties of such social-network graphs, i.e., among others, degree distribution, centrality measures, scaling laws and distribution of friendship.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {52},
numpages = {8},
keywords = {web data},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988751,
author = {Wang, Jiaxun and Li, Chunping},
title = {An Iterative Voting Method Based on Word Density for Text Classification},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988751},
doi = {10.1145/1988688.1988751},
abstract = {In this paper we present an iterative voting (IV) method using the density based weighting for text classification. An in-class word density is used to weight for each word in a topic, so that the word in documents has an array of weights to vote for given topics, and the highest scored topic will be labeled. During the voting process, the iteration strategy is applied for improving the classification effectiveness. This method shows the competitive performance against SVM, NB, KNN, and it has better time efficiency.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {53},
numpages = {5},
keywords = {iterative voting, classification, word density},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988752,
author = {Vavliakis, Konstantinos N. and Gemenetzi, Konstantina and Mitkas, Pericles A.},
title = {A Correlation Analysis of Web Social Media},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988752},
doi = {10.1145/1988688.1988752},
abstract = {In this paper we analyze and compare three popular content creation and sharing websites, namely Panoramio, YouTube and Epinions. This analysis aims in advancing our understanding of Web Social Media and their impact, and may be useful in creating feedback mechanisms for increasing user participation and sharing. For each of the three websites, we select five fundamental factors appearing in all content centered Web Social Media and we use regression analysis to calculate their correlation. We present findings of statistically important correlations among these key factors and we rank the discovered correlations according to the degree of their influence. Furthermore, we perform analysis of variance in distinct subgroups of the collected data and we discuss differences found in the characteristics of these subgroups and how these differences may affect correlation results.Although we acknowledge that correlation does not imply causality, the discovered correlations may be a first step towards discovering causality laws behind content contribution, commenting and the formulation of friendship relations. These causality laws are useful for boosting the user participation in social media.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {54},
numpages = {5},
keywords = {ANOVA, social media, correlation, regression analysis},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988753,
author = {Boyadzhiev, Dimo},
title = {Teacher Education with Share.TEC Web-Based Repository System},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988753},
doi = {10.1145/1988688.1988753},
abstract = {In 2010 the first prototype of Share.TEC (www.share-tec.eu) repository system was developed. The system is designed as a highly flexible portal which is supposed to give access to a great variety of Teacher Education (TE) resources. At the center of the Share.TEC system is the repository system which stores metadata for TE resources. The resources are described and classified in detail, which allows the system to recommend certain resources to different users depending on their profiles. The basic purpose of this paper is to examine the extent to which the predefined features of the system were developed in the first prototype and the extent to which the system meets the needs of the target users. For this purpose the system was initially tested by the authors of this paper and the prototype has now been offered for testing to a group of 12 volunteer university and school teachers. Having many years in teaching and training environment the teachers belong to the group of target users which can produce relevant and comprehensive interaction with the system. The feedback will be summarized in this paper and will become a milestone for the final release of the system.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {55},
numpages = {2},
keywords = {teacher education, web-based repository, prototype testing},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988754,
author = {Rawat, Rakesh and Nayak, Richi and Li, Yuefeng},
title = {Improving Web Database Search Incorporating Users Query Information},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988754},
doi = {10.1145/1988688.1988754},
abstract = {The growing importance and need of data processing for information extraction is vital for Web databases. Due to the sheer size and volume of databases, retrieval of relevant information as needed by users has become a cumbersome process. Information seekers are faced by information overloading - too many result sets are returned for their queries. Moreover, too few or no results are returned if a specific query is asked. This paper proposes a ranking algorithm that gives higher preference to a user's current search and also utilizes profile information in order to obtain the relevant results for a user's query.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {56},
numpages = {5},
keywords = {ranking SQL search results, feature importance technique based ranking, ranking personalized search results, query ranking},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988755,
author = {Costa, Alberto and Roda, Fabio},
title = {Recommender Systems by Means of Information Retrieval},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988755},
doi = {10.1145/1988688.1988755},
abstract = {In this paper we present a method for reformulating the Recommender Systems problem in an Information Retrieval one. In our tests we have a dataset of users who give ratings for some movies; we hide some values from the dataset, and we try to predict them again using its remaining portion (the so-called "leave-n-out approach").In order to use an Information Retrieval algorithm, we reformulate this Recommender Systems problem in this way: a user corresponds to a document, a movie corresponds to a term, the active user (whose rating we want to predict) plays the role of the query, and the ratings are used as weigths, in place of the weighting schema of the original IR algorithm.The output is the ranking list of the documents ("users") relevant for the query ("active user"). We use the ratings of these users, weighted according to the rank, to predict the rating of the active user. We carry out the comparison by means of a typical metric, namely the accuracy of the predictions returned by the algorithm, and we compare this to the real ratings from users. In our first tests, we use two different Information Retrieval algorithms: LSPR, a recently proposed model based on Discrete Fourier Transform, and a simple vector space model.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {57},
numpages = {5},
keywords = {information retrieval, recommender systems, reformulation},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988756,
author = {Antezana, Erick and Blond\'{e}, Ward and Venkatesan, Aravind and De Baets, Bernard and Mironov, Vladimir and Kuiper, Martin},
title = {Semantic Systems Biology: Enabling Integrative Biology via Semantic Web Technologies},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988756},
doi = {10.1145/1988688.1988756},
abstract = {The vast amounts of knowledge in the biomedical domain have paved the way for a new paradigm in biological research called Systems Biology, essentially an approach that relies on the integration of all available knowledge of a biological system in a single model. This approach promotes a comprehensive understanding of biological systems, driven by data integration and mathematical modelling. However, the sheer volume, variation and complexity of the current biological data pose a number of hurdles in knowledge management that need to be overcome. The Semantic Web offers various solutions to these challenges. With our initiative, named Semantic Systems Biology (SSB), we augment the systems biology approach with semantic web technologies to enable smooth data integration, rigorous knowledge representation, efficient querying, and hypothesis generation. Here we present an overview of the projects associated with the SSB initiative. Access to our resources developed within the SSB frame is provided on our website: http://www.semantic-systems-biology.org.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {58},
numpages = {5},
keywords = {semantics, OWL, RDF, semantic web technology, SPARQL, bio-ontologies, systems biology},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988757,
author = {Venkatesan, Aravind and Blond\'{e}, Ward and Antezana, Erick and Skillingstad, Mats and Marshall, M Scott and De Baets, Bernard and Mironov, Vladimir and Kuiper, Martin},
title = {The RDF Foundry: Call for an Initiative to Build Enhanced RDF Resources for Biological Data Integration},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988757},
doi = {10.1145/1988688.1988757},
abstract = {Currently, the OBO Foundry plays an important role by setting guidelines to formalise the concepts within the biomedical domain. The ontologies within the OBO Foundry are usually represented in the OBO ontology language. While being human-readable, this language lacks the computational rigour required for the Semantic Web (SW). Consequently, the RDF and OWL languages, both fundamental components of the SW technology stack, are being increasingly adopted by the biomedical community to exchange biological knowledge in a computer intelligible form. Some of the OBO- formatted ontologies have been made available in OWL, thus signalling a move towards the SW. OWL provides support for automated reasoning, which is its raison d'\^{e}tre. Unfortunately, automated reasoning on the massive volumes of data that are typical of the biomedical domain is riddled with performance limitations. Due to consistent support for the SPARQL specification in triple store implementations, as well as the ability to simulate some types of reasoning with pre-computed closures, RDF has evolved into a language of choice for knowledge exchange within the framework of the SW. Here, we discuss the need to establish a foundry charged with the task of harmonizing biomedical RDF resources, acting along the same lines as the OBO Foundry. To substantiate the need for an RDF Foundry, we provide the outcome of a small survey we have conducted to highlight the domain coverage, redundancies, and comprehensiveness of results obtained from a few representative distributed resources available today.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {59},
numpages = {5},
keywords = {query federation, RDF foundry, RDF, knowledge base, SPARQL, OWL, data integration},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988758,
author = {Roda, Fabio and Costa, Alberto and Liberti, Leo},
title = {Optimal Recommender Systems Blending},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988758},
doi = {10.1145/1988688.1988758},
abstract = {In the Recommender Systems field ensemble techniques gain growing interest. This approach is based on the idea of mixing many recommenders and to get an average prediction from all of them. Even if it is useful this process may be very expensive from a computational point of view. We propose the use of Operations Research techniques in order to optimize the balance of different predictors and to accelerate it. We show that this problem can be generalized, thus we provide a mathematical framework which helps to find further improvements.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {60},
numpages = {3},
keywords = {recommender systems, optimization, collaborative filtering},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988759,
author = {Stefanidakis, Michalis and Papadakis, Ioannis},
title = {Linking the (Un)Linked Data through Backlinks},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988759},
doi = {10.1145/1988688.1988759},
abstract = {This paper proposes a framework capable of enhancing the interlinking between Linked Open Data -- LOD repositories. Such interlinking is achieved through the realization of back-linking. Backlinking refers to the consistent management of the references that are made to a resource within a LOD repository from other repositories through their triples.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {61},
numpages = {5},
keywords = {interlinking, linked data, LOD, backlinks},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988760,
author = {Gohr, Andr\'{e} and Hinneburg, Alexander and Spiliopoulou, Myra and Usbeck, Ricardo},
title = {On the Distinctiveness of Tags in Collaborative Tagging Systems},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988760},
doi = {10.1145/1988688.1988760},
abstract = {We study in a quantitative way whether the most popular tags in a collaborative tagging system are distinctive features when looking at the underlying content. For any set of annotations being helpful in searching, this property must necessarily hold to a strong degree. Our initial experiments show that the most frequent tags in CiteULike are distinctive features, despite the process of annotating documents is not centrally coordinated nor correction mechanisms like in a Wiki-system are used.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {62},
numpages = {5},
keywords = {text mining, collaborative information systems, tagging},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988761,
author = {Estahbanati, Asieh and Javidan, Reza and Dezfooli, Mashalla Abbasi},
title = {Implementation of a New Method for Stemming in Persian Language},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988761},
doi = {10.1145/1988688.1988761},
abstract = {In this paper, a new stemmer algorithm for the Persian language is implemented. It is based on Kazem Taghva algorithm. The evaluation results of the proposed method on the small Farsi document collections are acceptable. But some problems in the morphological based stemmers in Farsi language are found. So some methods are proposed to solve these problems.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {63},
numpages = {5},
keywords = {Farsi language, algorithm, Persian language, stemming},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988763,
author = {Nefedov, Nikolai},
title = {Multiple-Membership Communities Detection in Mobile Networks},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988763},
doi = {10.1145/1988688.1988763},
abstract = {This paper addresses a problem of overlapped communities detection and its applications in mobile networks. The suggested method is based on "soft" communities detection using modularity maximization and may be used to improve efficiency of mobile advertisements and to make recommendations and missing links predictions. The method is applied for analysis of mobile users data collected at Nokia data collection campaign. In particular, we outline possible applications of soft community detection in single and multi-layer graphs.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {64},
numpages = {6},
keywords = {community detection, multi-layer graphs, recommendations},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988764,
author = {Poomagal, S. and Hamsapriya, T.},
title = {Optimized K-Means Clustering with Intelligent Initial Centroid Selection for Web Search Using URL and Tag Contents},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988764},
doi = {10.1145/1988688.1988764},
abstract = {With the vast amount of information available online, searching results for a given query requires the user to go through many titles and snippets. This searching time can be reduced by clustering search results into clusters so that the user can select the relevant cluster at a glance by looking at the cluster labels. For web page clustering, terms (features) can be extracted from different parts of the web page. Giansalvatore, Salvatore and Alessandro have extracted terms from the entire web page for clustering. Number of terms returned in this case is more and it produces lengthy vectors. To reduce the size of the vector, Stanis law Osinski et al., and Ahmed Sameh and Amar Kadray have considered terms from the snippets.In this work, terms are extracted from the URL (Uniform Resource Locator), Title tag and Meta tag to cluster the web documents. The reason for selecting these parts of a web page is that they have the keywords which are available in a web page. Among existing clustering algorithms, K-means algorithm is a simple algorithm and can be easily implemented for solving many practical problems. The disadvantage of K-means algorithm is the random selection of initial centroids and this paper selects initial centroids by calculating the midpoint. The proposed method of clustering is compared with Snippet based clustering and URL and Tag content based traditional K-means clustering in terms of Intra-cluster distance and Inter-cluster distance.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {65},
numpages = {8},
keywords = {intra-cluster distance, inter-cluster distance, distance function, search engine, snippets, clustering, stop words, centroid, queries, stemming},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988765,
author = {Criado, J. Ignacio and E-Mart\'{\i}n, Yolanda and Camacho, David},
title = {Experiences Using Social Networks in Spanish Public Administrations},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988765},
doi = {10.1145/1988688.1988765},
abstract = {Public administrations are developing several mechanisms to increase the reception level or the impact of the information that they communicate (i.e public policy-making or public service delivery) using for this, marketing techniques. Therefore, we may consider the concept of marketing in the public sector as the process of identifying the needs of a target audience to try to meet them, taking into account at the same time the objectives of the organization and the society. This paper aims to address this reality, regarding to the new opportunities resulting in the use of the Internet. Therefore, the purpose of this paper is to analyze how the public administrations are using Internet and, above all, the tools associated with social networks, to carry out the marketing process of their policies and public services. This study shows several experiencies to integrate the citizenry within a more collaborative information process.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {66},
numpages = {5},
keywords = {citizen, public administration, institutional advertising, social networks},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988766,
author = {Tatar, Alexandru and Leguay, J\'{e}r\'{e}mie and Antoniadis, Panayotis and Limbourg, Arnaud and de Amorim, Marcelo Dias and Fdida, Serge},
title = {Predicting the Popularity of Online Articles Based on User Comments},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988766},
doi = {10.1145/1988688.1988766},
abstract = {Understanding user participation is fundamental in anticipating the popularity of online content. In this paper, we explore how the number of users' comments during a short observation period after publication can be used to predict the expected popularity of articles published by a countrywide online newspaper. We evaluate a simple linear prediction model on a real dataset of hundreds of thousands of articles and several millions of comments collected over a period of four years. Analyzing the accuracy of our proposed model for different values of its basic parameters we provide valuable insights on the potentials and limitations for predicting content popularity based on early user activity.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {67},
numpages = {8},
keywords = {social media, online social networks, prediction, user behavior, content popularity},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988767,
author = {Lopes, Giseli Rabello and da Silva, Roberto and de Oliveira, J. Palazzo M.},
title = {Applying Gini Coefficient to Quantify Scientific Collaboration in Researchers Network},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988767},
doi = {10.1145/1988688.1988767},
abstract = {Some of the metrics more commonly used for Social Networks Analysis (SNA) do not consider the weights of relationships between the actors of the analyzed Social Network, if it exists. These weights aim to measure the importance of the relational ties between actors and also are important to be considered in a SNA. This paper purposes the Gini Coefficient to be applied on Social Networks Analysis. Our initial results demonstrate the validity and applicability of this approach for a collaboration of Brazilian network scientists.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {68},
numpages = {6},
keywords = {social networks analysis, Gini coefficient, co-author social networks},
location = {Sogndal, Norway},
series = {WIMS '11}
}

@inproceedings{10.1145/1988688.1988768,
author = {Doctor, Miguel and Moreno, \'{A}ngel and Mu\~{n}oz, Pablo and D\'{\i}az, Daniel and R-Moreno, Mar\'{\i}a Dolores},
title = {Intelligent Social Networks},
year = {2011},
isbn = {9781450301480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1988688.1988768},
doi = {10.1145/1988688.1988768},
abstract = {Personal homepages, blogs or virtual communities have contributed to the birth of the Social Networks. The success of these platforms will continue to increase while they are able to offer tools and services to improve users' social relationships. The rapid evolution of social networks, the growing business opportunities and the possibility to apply new techniques to a relatively unexplored domain, have awakened strong interest among researchers. The potential benefits have generated the need to be the first one to achieve an enough level of autonomy to provide customized services for both users and product providers.But the true revolution will arrive when social networks become "smart". To build these new intelligent systems we propose to use Artificial Intelligence techniques, more concretely plan recognition. In this paper we propose an architecture able to recognize the users intentions from partial observations of their actions. In addition, we present three scenarios where our system can be useful: Online commercial intentions, adaptive user interfaces and identity theft and extortion detection.},
booktitle = {Proceedings of the International Conference on Web Intelligence, Mining and Semantics},
articleno = {69},
numpages = {8},
keywords = {online-commercial intention, social networks, extortion detection, plan recognition, custom services},
location = {Sogndal, Norway},
series = {WIMS '11}
}