Search and Hyperlinking Task at MediaEval 2012

•

0 likes•302 views

The Search and Hyperlinking Task was one of the Brave New Tasks at MediaEval 2012. The Task consisted of two sub-tasks which focused on search and linking in retrieval from a collection of semi-professional video content. These tasks followed up on research carried out within the MediaEval 2011 Rich Speech Retrieval (RSR) Task and the VideoCLEF 2009 Linking Task.

Search and Hyperlinking Task at MediaEval 2012

Search and Hyperlinking Task
at MediaEval 2012

Maria Eskevich1 , Gareth J.F. Jones1 , Shu Chen1
Robin Aly2 , Roeland Ordelman2
Martha Larson3
1 Dublin City University, Dublin, Ireland
2 University of Twente, The Netherlands
3 Delft University of Technology, Delft, The Netherlands

Search and Hyperlinking Task at MediaEval 2012

Background

Search and Hyperlinking Task at MediaEval 2012

Brave New Task

Search and Hyperlinking Task at MediaEval 2012

Brave New Task and Crowdsourcing

Search and Hyperlinking Task at MediaEval 2012

Brave New Task: Search and Hyperlinking

Previous work:
MediaEval 2011: Rich Speech Retrieval Task
VideoCLEF 2009: Linking Task

Search and Hyperlinking Task at MediaEval 2012

Sub-tasks

Search sub-task:
Known-item search:
Textual queries only
Multimodal queries (text + video clues)
Required runs:
1 submission for 1-best output of each ASR transcript
Linking sub-task
Ad-hoc search for videos that can potentially be linked to
the anchor videos (ground truth of the Search subtask)
Required runs:
use of ASR 1-best transcripts as representation
*Additional runs:
use team output of Search subtask as video anchors for
Linking sub-task.

Search and Hyperlinking Task at MediaEval 2012

Data: blip10000

ASR Transcript:
LIMSI/Vocapia:
Confusion networks
LIUM:
1-best
Lattices
Conﬁsion networks
Video clues:
Shot boundaries (TU Berlin)

Concept-based descriptors based on a list of 589 concepts
(University of Oxford)
Face detection results (INRIA)

Search and Hyperlinking Task at MediaEval 2012

Evaluation: Search sub-task

Search and Hyperlinking Task at MediaEval 2012

Evaluation: Search sub-task

Mean Reciprocal Rank (MRR):

1
RR =
RANK
Mean Generalized Average Precision (mGAP):

1
GAP = . PENALTY
RANK

Search and Hyperlinking Task at MediaEval 2012

Evaluation: Search sub-task

Mean Average Segment Precision (MASP):
Ranking + Length of (ir)relevant content

Segment Precision (SP[r ]) at rank r :

Search and Hyperlinking Task at MediaEval 2012

Relevance Evaluation via Crowdsourcing:
Amazon MTurk HIT

Search and Hyperlinking Task at MediaEval 2012

Evaluation: Linking sub-task

Search and Hyperlinking Task at MediaEval 2012

Relevance Evaluation via Crowdsourcing
Details

Assessment level:
Videos
Provided segments:
Length varies across runs and participants

Search and Hyperlinking Task at MediaEval 2012

Participants

Group Search Linking
Charles University in Prague (CUNI) 5 –
Dublin City University (DCU) 4 6
Ghent University (MMLab) 4 4+4
INRIA/IRISA – 5
University of Twente (UTwente) 3 1

Search and Hyperlinking Task at MediaEval 2012

Search sub-task results

Search and Hyperlinking Task at MediaEval 2012

Linking sub-task results

Search and Hyperlinking Task at MediaEval 2012

Thank you for your attention!

Participants presentations:
Search sub-task:
Maria Eskevich, Dublin City University
Petra Galuscakova, Charles University in Prague
Search and Linking sub-task:
Danish Nadeem, University of Twente
Linking sub-task:
Camille Guinaudeau, INRIA/IRISA
Shu Chen, Dublin City University
Search and Linking sub-task:
Tom de Nies, University of Chent

Search and Hyperlinking Task at MediaEval 2012

Thank you for your attention!
Buon compleanno Robin!

Participants presentations:
Search sub-task:
Maria Eskevich, Dublin City University
Petra Galuscakova, Charles University in Prague
Search and Linking sub-task:
Danish Nadeem, University of Twente
Linking sub-task:
Camille Guinaudeau, INRIA/IRISA
Shu Chen, Dublin City University
Search and Linking sub-task:
Tom de Nies, University of Chent

https://imatge-upc.github.io/synthref/ Integrating computer vision with natural language processing has achieved significant progress over the last years owing to the continuous evolution of deep learning. A novel vision and language task, which is tackled in the present Master thesis is referring video object segmentation, in which a language query defines which instance to segment from a video sequence. One of the biggest challenges for this task is the lack of relatively large annotated datasets since a tremendous amount of time and human effort is required for annotation. Moreover, existing datasets suffer from poor quality annotations in the sense that approximately one out of ten language expressions fails to uniquely describe the target object. The purpose of the present Master thesis is to address these challenges by proposing a novel method for generating synthetic referring expressions for an image (video frame). This method pro- duces synthetic referring expressions by using only the ground-truth annotations of the objects as well as their attributes, which are detected by a state-of-the-art object detection deep neural network. One of the advantages of the proposed method is that its formulation allows its application to any object detection or segmentation dataset. By using the proposed method, the first large-scale dataset with synthetic referring expressions for video object segmentation is created, based on an existing large benchmark dataset for video instance segmentation. A statistical analysis and comparison of the created synthetic dataset with existing ones is also provided in the present Master thesis. The conducted experiments on three different datasets used for referring video object segmentation prove the efficiency of the generated synthetic data. More specifically, the obtained results demonstrate that by pre-training a deep neural network with the proposed synthetic dataset one can improve the ability of the network to generalize across different datasets, without any additional annotation cost. This outcome is even more important taking into account that no additional annotation cost is involved.

What java developers (don’t) know about api compatibility

Jens Dietrich

Icsm20.ppt

Yann-Gaël Guéhéneuc

Transformers to Learn Hierarchical Contexts in Multiparty Dialogue

Jinho Choi

Icsm19.ppt

Yann-Gaël Guéhéneuc

Exploratory Study of Slack Q&A Chats as a Mining Source for Software Engineer...

Preetha Chatterjee

Monthly, 50 million users visit Stack Overflow, a popular Q&A forum used by software developers, to share and gather knowledge and help with coding problems. Although Q&A forums serve as a good resource for seeking help from developers beyond the local team, the abundance of information can cause developers, especially novice software engineers, to spend considerable time in identifying relevant answers and suitable suggested fixes. This exploratory study aims to understand how novice software engineers direct their efforts and what kinds of information they focus on within a post selected from the results returned in response to a search query on Stack Overflow. The results can be leveraged to improve the Q&A forum interface, guide tools for mining forums, and potentially improve granularity of traceability mappings involving forum posts. We qualitatively analyze the novice software engineers’ perceptions from a survey as well as their annotations of a set of Stack Overflow posts. Our results indicate that novice software engineers pay attention to only 27% of code and 15-21% of text in a Stack Overflow post to understand and determine how to apply the relevant information to their context. Our results also discern the kinds of information prominent in that focus.

From TREC to Watson: is open domain question answering a solved problem?

Constantin Orasan

Question answering

Nafiseh Navabpour

Deep Natural Language Processing for Search and Recommender Systems

Huiji Gao

Tutorial for KDD 2019: Search and recommender systems process rich natural language text data such as user queries and documents. Achieving high-quality search and recommendation results requires processing and understanding such information effectively and efficiently, where natural language processing (NLP) technologies are widely deployed. In recent years, the rapid development of deep learning models has been proven successful for improving various NLP tasks, indicating their great potential of promoting search and recommender systems. In this tutorial, we summarize the current effort of deep learning for NLP in search/recommender systems. We first give an overview of search/recommender systems with NLP, then introduce basic concept of deep learning for NLP, covering state-of-the-art technologies in both language understanding and language generation. After that, we share our hands-on experience with LinkedIn applications. In the end, we highlight several important future trends.

Mining Code Examples with Descriptive Text from Software Artifacts

Preetha Chatterjee

Using Interactive GA for Requirements Prioritization

Francis Palma

Search and Hyperlinking Overview @MediaEval2014Maria Eskevich

Extracting Archival-Quality Information from Software-Related Chats

Preetha Chatterjee

Software developers are increasingly having conversations about software development via online chat services. Many of those chat communications contain valuable information, such as code descriptions, good programming practices, and causes of common errors/exceptions. However, the nature of chat community content is transient, as opposed to the archival nature of other developer communications such as email, bug reports and Q&A forums. As a result, important information and advice are lost over time. The focus of this dissertation is Extracting Archival Information from Software-Related Chats, specifically to (1) automatically identify conversations which contain archival-quality information, (2) accurately reduce the granularity of the information reported as archival information, and (3) conduct a case study to investigate how archival quality information extracted from chats compare to related posts in Q&A forums. Archiving knowledge from developer chats that could be used potentially in several applications such as: creating a new archival mechanism available to a given chat community, augmenting Q&A forums, or facilitating the mining of specific information and improving software maintenance tools.

My favorite apps 2010

Milpitas High School

André carvalhoAna Barreiros

Estadística iVictor Antonio Vizcarra Paredes

Tiempos modernosCande Caldora

авторская песня

Татьяна Л

empresa inteligente

guestb26ebc

Assembly Man

David Holzel

Nativos

Miguel Fernando Pineda Medina

Gareth Jones 1209

Yandex

Profile-based Dataset Recommendation for RDF Data Linking

Mohamed BEN ELLEFI

With the emergence of the Web of Data, most notably Linked Open Data (LOD), an abundance of data has become available on the web. However, LOD datasets and their inherent subgraphs vary heavily with respect to their size, topic and domain coverage, the schemas and their data dynamicity (respectively schemas and metadata) over the time. To this extent, identifying suitable datasets, which meet spefic criteria, has become an increasingly important, yet challenging task to support issues such as entity retrieval or semantic search and data linking. Particularly with respect to the interlinking issue, the current topology of the LOD cloud underlines the need for practical and ecient means to recommend suitable datasets: currently, only well-known reference graphs such as DBpedia (the most obvious target), YAGO or Freebase show a high amount of in-links, while there exists a long tail of potentially suitable yet under-recognized datasets. This problem is due to the semantic web tradition in dealing with "fnding candidate datasets to link to", where data publishers are used to identify target datasets for interlinking. While an understanding of the nature of the content of specic datasets is a crucial prerequisite for the mentioned issues, we adopt in this dissertation the notion of \dataset prole" | a set of features that describe a dataset and allow the comparison of dierent datasets with regard to their represented characteristics. Our rst research direction was to implement a collaborative ltering-like dataset recommendation approach, which exploits both existing dataset topic proles, as well as traditional dataset connectivity measures, in order to link LOD datasets into a global dataset-topic-graph. This approach relies on the LOD graph in order to learn the connectivity behaviour between LOD datasets. However, experiments have shown that the current topology of the LOD cloud group is far from being complete to be considered as a ground truth and consequently as learning data. Facing the limits the current topology of LOD (as learning data), our research has led to break away from the topic proles representation of \learn to rank" approach and to adopt a new approach for candidate datasets identication where the recommendation is based on the intensional proles overlap between dierent datasets. By intensional prole, we understand the formal representation of a set of schema concept labels that best describe a dataset and can be potentially enriched

Developing an evaluation strategy to gain insights into the ROER4D multi-nati...

SarahG_SS

Presentation at the OE Global Conference held in Banff, Canada in April 2015. This presentation introduces the development of the evaluation strategy, using Utilization Focused Evaluation (UFE), for the ROER4D Project (http://roer4d.org/). You can access the abstract here: http://conference.oeconsortium.org/2015/presentation/developing-an-evaluation-strategy-to-gain-insights-into-a-multi-national-project-roer4d/

VII Jornadas eMadrid "Education in exponential times". "Analysing and Alterin...

eMadrid network

What's hot

Seq2seq Model to Tokenize the Chinese Language

Jinho Choi

Overview of the 2014 ALTA Shared Task: Identifying Expressions of Locations i...

Diego Molla-Aliod

Finding Help with Programming Errors: An Exploratory Study of Novice Software...

Preetha Chatterjee

From TREC to Watson: is open domain question answering a solved problem?

Constantin Orasan

Question answering

Nafiseh Navabpour

Deep Natural Language Processing for Search and Recommender Systems

Huiji Gao

Mining Code Examples with Descriptive Text from Software Artifacts

Preetha Chatterjee

Using Interactive GA for Requirements Prioritization

Francis Palma

Search and Hyperlinking Overview @MediaEval2014Maria Eskevich

Extracting Archival-Quality Information from Software-Related Chats

Preetha Chatterjee

What's hot (10)

Seq2seq Model to Tokenize the Chinese Language

Overview of the 2014 ALTA Shared Task: Identifying Expressions of Locations i...

Finding Help with Programming Errors: An Exploratory Study of Novice Software...

From TREC to Watson: is open domain question answering a solved problem?

Question answering

Deep Natural Language Processing for Search and Recommender Systems

Mining Code Examples with Descriptive Text from Software Artifacts

Using Interactive GA for Requirements Prioritization

Search and Hyperlinking Overview @MediaEval2014

Extracting Archival-Quality Information from Software-Related Chats

Viewers also liked

My favorite apps 2010

Milpitas High School

André carvalhoAna Barreiros

Estadística iVictor Antonio Vizcarra Paredes

Tiempos modernosCande Caldora

авторская песня

Татьяна Л

empresa inteligente

guestb26ebc

Assembly Man

David Holzel

Nativos

Miguel Fernando Pineda Medina

Viewers also liked (8)

My favorite apps 2010

André carvalho

Estadística i

Tiempos modernos

авторская песня

empresa inteligente

Assembly Man

Nativos

Similar to Search and Hyperlinking Task at MediaEval 2012

Gareth Jones 1209

Yandex

Profile-based Dataset Recommendation for RDF Data Linking

Mohamed BEN ELLEFI

Developing an evaluation strategy to gain insights into the ROER4D multi-nati...

SarahG_SS

VII Jornadas eMadrid "Education in exponential times". "Analysing and Alterin...

eMadrid network

SE@M 2010: Automatic Keywords Extraction - a Basis for Content Recommendation

Ivana Bosnic

DCU Search Runs at MediaEval 2012: Search and Hyperlinking TaskMediaEval2012

iLastic: Linked Data Generation Workflow and User Interface for iMinds Schola...

andimou

Enriching scholarly data with metadata enhances the publications’ meaning. Unfortunately, different publishers of overlapping or complementary scholarly data neglect general-purpose solutions for metadata and instead use their own ad-hoc solutions. This leads to duplicate efforts and entails non-negligible implementation and maintenance costs. In this paper, we propose a reusable Linked Data publishing workflow that can be easily adjusted by different data owners to (i) generate and publish Linked Data, and (ii) align scholarly data repositories with enrichments over the publications’ content. As a proof-of-concept, the proposed workflow was applied to the iMinds research institute data warehouse, which was aligned with publications’ content derived from Ghent University’s digital repository. Moreover, we developed a user interface to help lay users with the exploration of the iLastic Linked Data set. Our proposed approach relies on a general-purpose workflow. This way, we manage to reduce the development and maintenance costs and increase the quality of the resulting Linked Data.

A Context-Aware Retrieval System for Mobile Applications

marcopavan83

We present a prototype recommendation system for mobile applications that exploits a rather general description of the user’s context. One of the main features of the proposed solution is the proactive and completely automated procedure of querying the apps marketplace, able to retrieve a set of apps and to rank them on the basis of the current situation of the user. We also present a first experimental evaluation that confirms the effectiveness of the general design and implementation choices and sheds some light on the peculiar features and critical issues of recommendation systems for mobile applications.

Arnold_Kumar_NLC2014

Patricia Arnold

Developing an evaluation strategy to gain insights into the ROER4D multi-nati...

Open Education Global (OEGlobal)

A Semantic-enhanced Inference Framework for Heterogeneous Resources Management

Silvia Giannini

Online Index Extraction from Linked Open Data Sources

Fabio Benedetti

Contextual Recommendation of Social Updates, a tag-based framework

Adrien Joly

How to cope with information overload? In this presentation (and the corresponding paper), we propose a framework to improve the relevance of awareness information about people and subjects, by adapting recommendation techniques to real-time web data, in order to reduce information overload. The novelty of our approach relies on the use of contextual information about people's current activities to rank social updates which they are following on Social Networking Services and other collaborative software. The two hypothesis that we are supporting in this paper are: (i) a social update shared by person X is relevant to another person Y if the current context of Y is similar to X's context at time of sharing; and (ii) in a web-browsing session, a reliable current context of a user can be processed using metadata of web documents accessed by the user. We discuss the validity of these hypothesis by analyzing their results on experimental data. Presented by Adrien Joly, on the 28/08/2010, at the Active Media Technology (AMT) conference, Toronto, Ontario, Canada.

Knowledge discoverylaurahollink

SSSW

LinkedUp - Linked Data & Education

Stefan Dietze

Resource Discovery Landscape

Andy Powell

The Personal Networks of Novice Librarian Researchers

IRDL

This presentation reports the findings of an analysis of personal network data gathered from the novice librarian researcher participants of the summer workshop of the Institute for Research Design in Librarianship (IRDL), an institute designed to provide instruction in how to conduct a research project and establish a peer-network of like-minded library professionals to support each other throughout the research process. The first wave of data was gathered before the participants began IRDL, again at the completion of the workshop, at six months after completing the workshop, and will be gathered again at the one-year marker. The data gathered is about the people and the strength of the relationship in the personal research networks of each of the IRDL participants. During the presentation we will report on the observations of the research networks over time. Highlighted in the presentation is the use of the freely available, open source, web-based software used to gather the personal network data, EgoWeb 2.0. We will describe the process of customizing the survey software to ask questions about the names of people these novice researchers go to get or give advice or help related to research, how often they interact (related to research or not), modes in which the interactions take place, and whether or not the people in the network know each other. We will report the statistical results that the software computes, about density and closeness and provides a customizable visualization of the personal network.

Project Credit: Melissa Haendel - On the Nature of Credit

CASRAI

On the nature of Credit

mhaendel

The current oer search dilemma

Ishan Abeywardena, Ph.D.

This presentation discusses the current dilemma with respect to Open Educational Resources (OER) search. It introduces existing OER search methodologies and highlights their weaknesses. The Desirability framework for parametrically measuring the usefulness of an OER is also discussed. The desirability framework uses the D-index to measure the openness, accessibility and relevance of an OER. OERScout, a text mining based faceted search engine is introduced for improved OER search. It uses autonomously identified domain specific keywords, the D-index and faceted search to allow focused OER search.

Similar to Search and Hyperlinking Task at MediaEval 2012 (20)

Gareth Jones 1209

Profile-based Dataset Recommendation for RDF Data Linking

Developing an evaluation strategy to gain insights into the ROER4D multi-nati...

VII Jornadas eMadrid "Education in exponential times". "Analysing and Alterin...

SE@M 2010: Automatic Keywords Extraction - a Basis for Content Recommendation

DCU Search Runs at MediaEval 2012: Search and Hyperlinking Task

iLastic: Linked Data Generation Workflow and User Interface for iMinds Schola...

A Context-Aware Retrieval System for Mobile Applications

Arnold_Kumar_NLC2014

Developing an evaluation strategy to gain insights into the ROER4D multi-nati...

A Semantic-enhanced Inference Framework for Heterogeneous Resources Management

Online Index Extraction from Linked Open Data Sources

Contextual Recommendation of Social Updates, a tag-based framework

Knowledge discoverylaurahollink

LinkedUp - Linked Data & Education

Resource Discovery Landscape

The Personal Networks of Novice Librarian Researchers

Project Credit: Melissa Haendel - On the Nature of Credit

On the nature of Credit

The current oer search dilemma

More from Maria Eskevich

Video Hyperlinking (LNK) Task at TRECVid 2016

Maria Eskevich

Focus on spoken content in multimedia retrieval

Maria Eskevich

Audio/Video Search: Why? What? How?

Maria Eskevich

Creating a Data Collection for Evaluating Rich Speech Retrieval (LREC 2012)

Maria Eskevich

We describe the development of a test collection for the investigation of speech retrieval beyond identification of relevant content. This collection focus on satisfying user information needs for queries associated with specific types of speech acts. The collection is based on an archive of Internet video from Internet video sharing platform (blip.tv), and was provided by the MediaEval benchmarking initiative. A crowdsourcing approach is used to identify segments in the video data which contain speech acts, to create a description of the video containing the act and to generate search queries designed to refind this speech act. We describe and reflect on our experiences with crowdsourcing this test collection using the Amazon Mechanical Turk platform.We highlight the challenges of constructing this dataset, including the selection of the data source, design of the crowdsouring task and the specification of queries and relevant items.

DCU at the NTCIR-9 SpokenDoc Passage Retrieval Task

Maria Eskevich

We describe details of our runs and the results obtained for the "IR for Spoken Documents (SpokenDoc) Task'' at NTCIR-9. The focus of our participation in this task was the investigation of the use of segmentation methods to divide the manual and ASR transcripts into topically coherent segments. The underlying assumption of this approach is that these segments will capture passages in the transcript relevant to the query. Our experiments investigate the use of two lexical coherence based segmentation algorithms (TextTiling, C99). These are run on the provided manual and ASR transcripts, and the ASR transcript with stop words removed. Evaluation of the results shows that TextTiling consistently performs better than C99 both in segmenting the data into retrieval units as evaluated using the centre located relevant information metric and in having higher content precision in each automatically created segment.

Towards Methods for Efficient Access to Spoken Content in the AMI Corpus (SSC...Maria Eskevich

Comparing Retrieval Effectiveness of Alternative Content Segmentation Methods...

Maria Eskevich

We present an exploratory study of the retrieval of semi-professional user-generated Internet video. The study is based on the MediaEval 2011 Rich Speech Retrieval (RSR) task for which the dataset was taken from the Internet sharing platform blip.tv, and search queries associated with specific speech acts occurring in the video. We compare results from three participant groups using: automatic speech recognition system transcript (ASR), metadata manually assigned to each video by the user who uploaded it, and their combination. RSR 2011 was a known-item search for a single manually identified ideal jump-in point in the video for each query where playback should begin. Retrieval effectiveness is measured using the MRR and mGAP metrics. Using different transcript segmentation methods the participants tried to maximize the rank of the relevant item and to locate the nearest match to the ideal jump-in point. Results indicate that best overall results are obtained for topically homogeneous segments which have a strong overlap with the relevant region associated with the jump-in point, and that use of metadata can be beneficial when segments are unfocused or cover more than one topic.

New Metrics for Meaningful Evaluation of Informally Structured Speech Retriev...

Maria Eskevich

We introduce two new metrics for the evaluation of search effectiveness for informally structured speech data: mean average segment precision (MASP) which measures retrieval performance in terms of both content segmentation and ranking with respect to relevance; and mean average segment distance-weighted precision (MASDWP) which takes into account the distance between the start of the relevant segment and the retrieved segment. We demonstrate the effectiveness of these new metrics on a retrieval test collection based on the AMI meeting corpus.

More from Maria Eskevich (8)

Video Hyperlinking (LNK) Task at TRECVid 2016

Focus on spoken content in multimedia retrieval

Audio/Video Search: Why? What? How?

Creating a Data Collection for Evaluating Rich Speech Retrieval (LREC 2012)

DCU at the NTCIR-9 SpokenDoc Passage Retrieval Task

Towards Methods for Efficient Access to Spoken Content in the AMI Corpus (SSC...

Comparing Retrieval Effectiveness of Alternative Content Segmentation Methods...

New Metrics for Meaningful Evaluation of Informally Structured Speech Retriev...

Recently uploaded

Large Language Model (LLM) and it’s Geospatial Applications

Rohit Gautam

UiPath Test Automation using UiPath Test Suite series, part 5

DianaGray10

Enchancing adoption of Open Source Libraries. A case study on Albumentations.AI

Vladimir Iglovikov, Ph.D.

Presented by Vladimir Iglovikov: - https://www.linkedin.com/in/iglovikov/ - https://x.com/viglovikov - https://www.instagram.com/ternaus/ This presentation delves into the journey of Albumentations.ai, a highly successful open-source library for data augmentation. Created out of a necessity for superior performance in Kaggle competitions, Albumentations has grown to become a widely used tool among data scientists and machine learning practitioners. This case study covers various aspects, including: People: The contributors and community that have supported Albumentations. Metrics: The success indicators such as downloads, daily active users, GitHub stars, and financial contributions. Challenges: The hurdles in monetizing open-source projects and measuring user engagement. Development Practices: Best practices for creating, maintaining, and scaling open-source libraries, including code hygiene, CI/CD, and fast iteration. Community Building: Strategies for making adoption easy, iterating quickly, and fostering a vibrant, engaged community. Marketing: Both online and offline marketing tactics, focusing on real, impactful interactions and collaborations. Mental Health: Maintaining balance and not feeling pressured by user demands. Key insights include the importance of automation, making the adoption process seamless, and leveraging offline interactions for marketing. The presentation also emphasizes the need for continuous small improvements and building a friendly, inclusive community that contributes to the project's growth. Vladimir Iglovikov brings his extensive experience as a Kaggle Grandmaster, ex-Staff ML Engineer at Lyft, sharing valuable lessons and practical advice for anyone looking to enhance the adoption of their open-source projects. Explore more about Albumentations and join the community at: GitHub: https://github.com/albumentations-team/albumentations Website: https://albumentations.ai/ LinkedIn: https://www.linkedin.com/company/100504475 Twitter: https://x.com/albumentations

FIDO Alliance Osaka Seminar: The WebAuthn API and Discoverable Credentials.pdf

FIDO Alliance

LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...

DanBrown980551

Do you want to learn how to model and simulate an electrical network from scratch in under an hour? Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)! During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook. PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides: - A fully editable and extendable library for grid component modelling; - Visualization tools to display your network; - Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses; The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well. What you will learn during the webinar: - For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills; - For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.

DevOps and Testing slides at DASA Connect

Kari Kakkonen

Video Streaming: Then, Now, and in the Future

Alpen-Adria-Universität

In his public lecture, Christian Timmerer provides insights into the fascinating history of video streaming, starting from its humble beginnings before YouTube to the groundbreaking technologies that now dominate platforms like Netflix and ORF ON. Timmerer also presents provocative contributions of his own that have significantly influenced the industry. He concludes by looking at future challenges and invites the audience to join in a discussion.

Alt. GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using ...

James Anderson

Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management. The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM). Speakers: Bob Boule Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle. Gopinath Rebala Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.

GraphSummit Singapore | The Art of the Possible with Graph - Q2 2024

Neo4j

Epistemic Interaction - tuning interfaces to provide information for AI support

Alan Dix

Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024 https://alandix.com/academic/papers/synergy2024-epistemic/ As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.

By Design, not by Accident - Agile Venture Bolzano 2024

Pierluigi Pugliese

Goodbye Windows 11: Make Way for Nitrux Linux 3.5.0!

SOFTTECHHUB

As the digital landscape continually evolves, operating systems play a critical role in shaping user experiences and productivity. The launch of Nitrux Linux 3.5.0 marks a significant milestone, offering a robust alternative to traditional systems such as Windows 11. This article delves into the essence of Nitrux Linux 3.5.0, exploring its unique features, advantages, and how it stands as a compelling choice for both casual users and tech enthusiasts.

GraphSummit Singapore | Neo4j Product Vision & Roadmap - Q2 2024

Neo4j

20240605 QFM017 Machine Intelligence Reading List May 2024

Matthew Sinclair

Unlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdf

Malak Abu Hammad

Discover how MongoDB Atlas and vector search technology can revolutionize your application's search capabilities. This comprehensive presentation covers: * What is Vector Search? * Importance and benefits of vector search * Practical use cases across various industries * Step-by-step implementation guide * Live demos with code snippets * Enhancing LLM capabilities with vector search * Best practices and optimization strategies Perfect for developers, AI enthusiasts, and tech leaders. Learn how to leverage MongoDB Atlas to deliver highly relevant, context-aware search results, transforming your data retrieval process. Stay ahead in tech innovation and maximize the potential of your applications. #MongoDB #VectorSearch #AI #SemanticSearch #TechInnovation #DataScience #LLM #MachineLearning #SearchTechnology

GraphSummit Singapore | Graphing Success: Revolutionising Organisational Stru...

Neo4j

Sudheer Mechineni, Head of Application Frameworks, Standard Chartered Bank Discover how Standard Chartered Bank harnessed the power of Neo4j to transform complex data access challenges into a dynamic, scalable graph database solution. This keynote will cover their journey from initial adoption to deploying a fully automated, enterprise-grade causal cluster, highlighting key strategies for modelling organisational changes and ensuring robust disaster recovery. Learn how these innovations have not only enhanced Standard Chartered Bank’s data infrastructure but also positioned them as pioneers in the banking sector’s adoption of graph technology.

20240609 QFM020 Irresponsible AI Reading List May 2024

Matthew Sinclair

Communications Mining Series - Zero to Hero - Session 1

DianaGray10

This session provides introduction to UiPath Communication Mining, importance and platform overview. You will acquire a good understand of the phases in Communication Mining as we go over the platform with you. Topics covered: • Communication Mining Overview • Why is it important? • How can it help today’s business and the benefits • Phases in Communication Mining • Demo on Platform overview • Q/A

20 Comprehensive Checklist of Designing and Developing a Website

Pixlogix Infotech

Dive into the world of Website Designing and Developing with Pixlogix! Looking to create a stunning online presence? Look no further! Our comprehensive checklist covers everything you need to know to craft a website that stands out. From user-friendly design to seamless functionality, we've got you covered. Don't miss out on this invaluable resource! Check out our checklist now at Pixlogix and start your journey towards a captivating online presence today.

UiPath Test Automation using UiPath Test Suite series, part 6

DianaGray10

Welcome to UiPath Test Automation using UiPath Test Suite series part 6. In this session, we will cover Test Automation with generative AI and Open AI. UiPath Test Automation with generative AI and Open AI webinar offers an in-depth exploration of leveraging cutting-edge technologies for test automation within the UiPath platform. Attendees will delve into the integration of generative AI, a test automation solution, with Open AI advanced natural language processing capabilities. Throughout the session, participants will discover how this synergy empowers testers to automate repetitive tasks, enhance testing accuracy, and expedite the software testing life cycle. Topics covered include the seamless integration process, practical use cases, and the benefits of harnessing AI-driven automation for UiPath testing initiatives. By attending this webinar, testers, and automation professionals can gain valuable insights into harnessing the power of AI to optimize their test automation workflows within the UiPath ecosystem, ultimately driving efficiency and quality in software development processes. What will you get from this session? 1. Insights into integrating generative AI. 2. Understanding how this integration enhances test automation within the UiPath platform 3. Practical demonstrations 4. Exploration of real-world use cases illustrating the benefits of AI-driven test automation for UiPath Topics covered: What is generative AI Test Automation with generative AI and Open AI. UiPath integration with generative AI Speaker: Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP

Recently uploaded (20)

Large Language Model (LLM) and it’s Geospatial Applications

UiPath Test Automation using UiPath Test Suite series, part 5

Enchancing adoption of Open Source Libraries. A case study on Albumentations.AI

FIDO Alliance Osaka Seminar: The WebAuthn API and Discoverable Credentials.pdf

LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...

DevOps and Testing slides at DASA Connect

Video Streaming: Then, Now, and in the Future

Alt. GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using ...

GraphSummit Singapore | The Art of the Possible with Graph - Q2 2024

Epistemic Interaction - tuning interfaces to provide information for AI support

By Design, not by Accident - Agile Venture Bolzano 2024

Goodbye Windows 11: Make Way for Nitrux Linux 3.5.0!

GraphSummit Singapore | Neo4j Product Vision & Roadmap - Q2 2024

20240605 QFM017 Machine Intelligence Reading List May 2024

Unlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdf

GraphSummit Singapore | Graphing Success: Revolutionising Organisational Stru...

20240609 QFM020 Irresponsible AI Reading List May 2024

Communications Mining Series - Zero to Hero - Session 1

20 Comprehensive Checklist of Designing and Developing a Website

UiPath Test Automation using UiPath Test Suite series, part 6

Search and Hyperlinking Task at MediaEval 2012

1. Search and Hyperlinking Task at MediaEval 2012 Search and Hyperlinking Task at MediaEval 2012 Maria Eskevich1 , Gareth J.F. Jones1 , Shu Chen1 Robin Aly2 , Roeland Ordelman2 Martha Larson3 1 Dublin City University, Dublin, Ireland 2 University of Twente, The Netherlands 3 Delft University of Technology, Delft, The Netherlands

2. Search and Hyperlinking Task at MediaEval 2012 Background

3. Search and Hyperlinking Task at MediaEval 2012 Brave New Task

4. Search and Hyperlinking Task at MediaEval 2012 Brave New Task and Crowdsourcing

5. Search and Hyperlinking Task at MediaEval 2012 Brave New Task: Search and Hyperlinking Previous work: MediaEval 2011: Rich Speech Retrieval Task VideoCLEF 2009: Linking Task

6. Search and Hyperlinking Task at MediaEval 2012 Brave New Task: Search and Hyperlinking Previous work: MediaEval 2011: Rich Speech Retrieval Task VideoCLEF 2009: Linking Task What is Brave New about the Search and Hyperlinking? Uniﬁed scenario for 2 tasks: Search output results as input for Linking Use of crowdsourcing for results assessment: workers deﬁne the relevance of the video segments, the HIT can be run for each new submission and enrich overall results Search: ME10WWW dataset − > blip10000

7. Search and Hyperlinking Task at MediaEval 2012 Sub-tasks Search sub-task: Known-item search: Textual queries only Multimodal queries (text + video clues) Required runs: 1 submission for 1-best output of each ASR transcript Linking sub-task Ad-hoc search for videos that can potentially be linked to the anchor videos (ground truth of the Search subtask) Required runs: use of ASR 1-best transcripts as representation *Additional runs: use team output of Search subtask as video anchors for Linking sub-task.

8. Search and Hyperlinking Task at MediaEval 2012 Data: blip10000 ASR Transcript: LIMSI/Vocapia: Confusion networks LIUM: 1-best Lattices Conﬁsion networks Video clues: Shot boundaries (TU Berlin) Concept-based descriptors based on a list of 589 concepts (University of Oxford) Face detection results (INRIA)

9. Search and Hyperlinking Task at MediaEval 2012 Evaluation: Search sub-task

10. Search and Hyperlinking Task at MediaEval 2012 Evaluation: Search sub-task

11. Search and Hyperlinking Task at MediaEval 2012 Evaluation: Search sub-task

12. Search and Hyperlinking Task at MediaEval 2012 Evaluation: Search sub-task

13. Search and Hyperlinking Task at MediaEval 2012 Evaluation: Search sub-task

14. Search and Hyperlinking Task at MediaEval 2012 Evaluation: Search sub-task Mean Reciprocal Rank (MRR): 1 RR = RANK Mean Generalized Average Precision (mGAP): 1 GAP = . PENALTY RANK

15. Search and Hyperlinking Task at MediaEval 2012 Evaluation: Search sub-task Mean Average Segment Precision (MASP): Ranking + Length of (ir)relevant content Segment Precision (SP[r ]) at rank r :

16. Search and Hyperlinking Task at MediaEval 2012 Evaluation: Search sub-task Mean Average Segment Precision (MASP): Ranking + Length of (ir)relevant content Segment Precision (SP[r ]) at rank r :

17. Search and Hyperlinking Task at MediaEval 2012 Evaluation: Search sub-task Mean Average Segment Precision (MASP): Ranking + Length of (ir)relevant content Segment Precision (SP[r ]) at rank r : Average Segment Precision:

18. Search and Hyperlinking Task at MediaEval 2012 Evaluation: Search sub-task Mean Average Segment Precision (MASP): Ranking + Length of (ir)relevant content Segment Precision (SP[r ]) at rank r : Average Segment Precision: N 1 ASP = . SP[r ] · rel(sr ) n r =1 rel(sr ) = 1, if relevant content is present, otherwise rel(sr ) = 0

19. Search and Hyperlinking Task at MediaEval 2012 Relevance Evaluation via Crowdsourcing: Amazon MTurk HIT

20. Search and Hyperlinking Task at MediaEval 2012 Evaluation: Linking sub-task

21. Search and Hyperlinking Task at MediaEval 2012 Evaluation: Linking sub-task

22. Search and Hyperlinking Task at MediaEval 2012 Evaluation: Linking sub-task

23. Search and Hyperlinking Task at MediaEval 2012 Evaluation: Linking sub-task

24. Search and Hyperlinking Task at MediaEval 2012 Relevance Evaluation via Crowdsourcing Details Assessment level: Videos Provided segments: Length varies across runs and participants

25. Search and Hyperlinking Task at MediaEval 2012 Relevance Evaluation via Crowdsourcing Details Assessment level: Videos Provided segments: Length varies across runs and participants Workers explanation of relevance judgement: Relevant: ”Same” videos Videos are on the same topic Same program different topics Irrelevant: Same program different topics Different topics Different video styles: interview vs presentation

26. Search and Hyperlinking Task at MediaEval 2012 Participants Group Search Linking Charles University in Prague (CUNI) 5 – Dublin City University (DCU) 4 6 Ghent University (MMLab) 4 4+4 INRIA/IRISA – 5 University of Twente (UTwente) 3 1

27. Search and Hyperlinking Task at MediaEval 2012 Participants Group Search Linking Charles University in Prague (CUNI) 5 – Dublin City University (DCU) 4 6 Ghent University (MMLab) 4 4+4 INRIA/IRISA – 5 University of Twente (UTwente) 3 1

28. Search and Hyperlinking Task at MediaEval 2012 Search sub-task results

29. Search and Hyperlinking Task at MediaEval 2012 Linking sub-task results

30. Search and Hyperlinking Task at MediaEval 2012 Thank you for your attention! Participants presentations: Search sub-task: Maria Eskevich, Dublin City University Petra Galuscakova, Charles University in Prague Search and Linking sub-task: Danish Nadeem, University of Twente Linking sub-task: Camille Guinaudeau, INRIA/IRISA Shu Chen, Dublin City University Search and Linking sub-task: Tom de Nies, University of Chent

31. Search and Hyperlinking Task at MediaEval 2012 Thank you for your attention! Buon compleanno Robin! Participants presentations: Search sub-task: Maria Eskevich, Dublin City University Petra Galuscakova, Charles University in Prague Search and Linking sub-task: Danish Nadeem, University of Twente Linking sub-task: Camille Guinaudeau, INRIA/IRISA Shu Chen, Dublin City University Search and Linking sub-task: Tom de Nies, University of Chent

Search and Hyperlinking Task at MediaEval 2012

Recommended

Recommended

More Related Content

What's hot

What's hot (10)

Viewers also liked

Viewers also liked (8)

Similar to Search and Hyperlinking Task at MediaEval 2012

Similar to Search and Hyperlinking Task at MediaEval 2012 (20)

More from Maria Eskevich

More from Maria Eskevich (8)

Recently uploaded

Recently uploaded (20)

Search and Hyperlinking Task at MediaEval 2012