Original title in Spanish: Desambiguación de Palabras Polisémicas mediante Aprendizaje Semi-supervisado
Date: November 19, 2012
Venue: Córdoba, Argentina. Project on Word Sense Disambiguation for the MSc Specialization Course "Artificial Intelligence" at FaMAF, UNC (Faculty of Mathematics, Astronomy, Physics and Computation, National University of Córdoba)
Video: https://www.youtube.com/watch?v=qv9qZaBw-Qw
Este documento introduce los conceptos de predicado, dominio y dominio de verdad de predicados en lógica de predicados. Explica que un predicado es un enunciado que contiene una o más variables y se convierte en proposición cuando se sustituyen las variables por constantes. Define dominio como el conjunto de constantes que al sustituirse en el predicado lo transforman en proposición, y dominio de verdad como el conjunto de constantes que al sustituirse hacen que el predicado sea una proposición verdadera. Finalmente, introduce los cuantificadores universal y
Date: March 22, 2019
Venue: Stavanger, Norway. Symposium at the IAI group
Please cite, link to or credit this presentation when using it or part of it in your work.
About "Towards Better Text Understanding and Retrieval through Kernel Entity ...Darío Garigliotti
Summary of the paper "Towards Better Text Understanding and Retrieval through Kernel Entity Salience Modeling", presented at SIGIR 2018.
Date: October 17, 2018
Venue: London, UK. Reading group
Please cite, link to or credit this presentation when using it or part of it in your work.
A Semantic Search Approach to Task-Completion EnginesDarío Garigliotti
Date: July 8, 2018
Venue: Ann Arbor, MI, USA. Doctoral Consortium at the 41st International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '18)
Please cite, link to or credit this presentation when using it or part of it in your work.
Highlights of the 40th European Conference on Information Retrieval (ECIR '18)
Date: April 6, 2018
Venue: Stavanger, Norway. Symposium at the IAI group
Please cite, link to or credit this presentation when using it or part of it in your work.
A Semantic Search Approach to Task-Completion EnginesDarío Garigliotti
Date: February 27, 2018
Venue: Stavanger, Norway. UiS TN910 - Innovation and Project Awareness
Please cite, link to or credit this presentation when using it or part of it in your work.
This document summarizes Darío Garigliotti's work on constructing a knowledge base of entity-oriented search intents. It introduces key concepts like entities, entity types, RDF tuples, and knowledge bases. It then describes a pipeline approach for building the knowledge base, which involves acquiring refiners from queries, categorizing refiners, discovering intents, and constructing the knowledge base with triples linking intents to entities, categories, and expressing refiners. Evaluation is done on the accuracy of the extracted knowledge base facts. The full knowledge base contains 155k triples describing 31k intent profiles across 581 entity types. Potential applications include leveraging the knowledge base to identify intents in new queries and improving entity cards.
Este documento introduce los conceptos de predicado, dominio y dominio de verdad de predicados en lógica de predicados. Explica que un predicado es un enunciado que contiene una o más variables y se convierte en proposición cuando se sustituyen las variables por constantes. Define dominio como el conjunto de constantes que al sustituirse en el predicado lo transforman en proposición, y dominio de verdad como el conjunto de constantes que al sustituirse hacen que el predicado sea una proposición verdadera. Finalmente, introduce los cuantificadores universal y
Date: March 22, 2019
Venue: Stavanger, Norway. Symposium at the IAI group
Please cite, link to or credit this presentation when using it or part of it in your work.
About "Towards Better Text Understanding and Retrieval through Kernel Entity ...Darío Garigliotti
Summary of the paper "Towards Better Text Understanding and Retrieval through Kernel Entity Salience Modeling", presented at SIGIR 2018.
Date: October 17, 2018
Venue: London, UK. Reading group
Please cite, link to or credit this presentation when using it or part of it in your work.
A Semantic Search Approach to Task-Completion EnginesDarío Garigliotti
Date: July 8, 2018
Venue: Ann Arbor, MI, USA. Doctoral Consortium at the 41st International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '18)
Please cite, link to or credit this presentation when using it or part of it in your work.
Highlights of the 40th European Conference on Information Retrieval (ECIR '18)
Date: April 6, 2018
Venue: Stavanger, Norway. Symposium at the IAI group
Please cite, link to or credit this presentation when using it or part of it in your work.
A Semantic Search Approach to Task-Completion EnginesDarío Garigliotti
Date: February 27, 2018
Venue: Stavanger, Norway. UiS TN910 - Innovation and Project Awareness
Please cite, link to or credit this presentation when using it or part of it in your work.
This document summarizes Darío Garigliotti's work on constructing a knowledge base of entity-oriented search intents. It introduces key concepts like entities, entity types, RDF tuples, and knowledge bases. It then describes a pipeline approach for building the knowledge base, which involves acquiring refiners from queries, categorizing refiners, discovering intents, and constructing the knowledge base with triples linking intents to entities, categories, and expressing refiners. Evaluation is done on the accuracy of the extracted knowledge base facts. The full knowledge base contains 155k triples describing 31k intent profiles across 581 entity types. Potential applications include leveraging the knowledge base to identify intents in new queries and improving entity cards.
Date: October 2nd, 2017
Venue: Amsterdam, The Netherlands. The 2017 ACM SIGIR International Conference on Theory of Information Retrieval (ICTIR '17)
Corresponding article: https://arxiv.org/abs/1708.08291
Please cite, link to or credit this presentation when using it or part of it in your work.
Learning-to-Rank Target Types for Entity-Bearing QueriesDarío Garigliotti
Date: October 1st, 2017
Venue: Amsterdam, The Netherlands. LEARNER 2017, co-located with the 2017 ACM SIGIR International Conference on Theory of Information Retrieval (ICTIR '17)
Corresponding article: http://ceur-ws.org/Vol-2007/LEARNER2017_short_3.pdf
Please cite, link to or credit this presentation when using it or part of it in your work.
Date: March 13, 2017
Venue: Stavanger, Norway. Doctoral Seminar at the IAI group for the research visit of Prof. Maarten de Rijke
Please cite, link to or credit this presentation when using it or part of it in your work.
Date: October 7, 2016
Venue: Stavanger, Norway. Technical talk at UiS TN-IDE
Please cite, link to or credit this presentation when using it or part of it in your work.
Date: June 14, 2016
Venue: Oslo, Norway. Doctoral Seminar at HiOA
Please cite, link to or credit this presentation when using it or part of it in your work.
Date: June 10, 2016
Venue: Stavanger, Norway. Doctoral Seminar at the IAI group for the research visit of Prof. Kalervo Järvelin
Please cite, link to or credit this presentation when using it or part of it in your work.
Date: March 4, 2016
Venue: Trondheim, Norway. Doctoral Seminar at NTNU
Please cite, link to or credit this presentation when using it or part of it in your work.
Date: March 3rd, 2016
Venue: Trondheim, Norway. Doctoral Seminar at NTNU
Please cite, link to or credit this presentation when using it or part of it in your work.
Original title in Spanish: Si ésta es la respuesta, ¿cuál era la pregunta?
Date: November 20, 2013
Venue: Córdoba, Argentina. Project on Question Generation for the MSc Specialization Course "Natural Language Processing" (Faculty of Mathematics, Astronomy, Physics and Computation, National University of Córdoba)
Please cite, link to or credit this presentation when using it or part of it in your work.
Semi-supervised Learning for Word Sense DisambiguationDarío Garigliotti
Original title in Spanish: Desambiguación de Palabras Polisémicas mediante Aprendizaje Semi-supervisado
Date: September 20, 2013
Venue: Córdoba, Argentina. 42nd JAIIO - Argentine Journals of Informatics and Operating Research (JAIIO '13)
Please cite, link to or credit this presentation when using it or part of it in your work.
Date: August 2016
Venue: Saratov, Russian Federation. The 10th Russian Summer School in Information Retrieval (RuSSIR '16)
Please cite, link to or credit this presentation when using it or part of it in your work.
Semi-supervised Learning for Word Sense DisambiguationDarío Garigliotti
Original title in Spanish: Desambiguación de Palabras Polisémicas mediante Aprendizaje Semi-supervisado
Date: September 2013
Venue: Córdoba, Argentina. 42nd JAIIO - Argentine Journals of Informatics and Operating Research (JAIIO '13)
Corresponding article: https://arxiv.org/abs/1908.09641
Please cite the paper, and link to or credit this presentation when using it or part of it in your work.
Hierarchical clustering builds clusters hierarchically, by either merging or splitting clusters at each step. Agglomerative hierarchical clustering starts with each point as a separate cluster and successively merges the closest clusters based on a defined proximity measure between clusters. This results in a dendrogram showing the nested clustering structure. The basic algorithm computes a proximity matrix, then repeatedly merges the closest pair of clusters and updates the matrix until all points are in one cluster.
The document discusses several alternative classification techniques including rule-based classifiers, nearest neighbors classifiers, and Naive Bayes classifiers. It provides examples of how each technique works and some key aspects to consider, such as how to build rule-based classifiers directly from data or indirectly from other models like decision trees. It also covers concepts like mutual exclusivity of rules, rule coverage and accuracy, and how to order rules.
Date: September 25, 2017
Course: UiS DAT630 - Web Search and Data Mining (fall 2017) (https://github.com/kbalog/uis-dat630-fall2017)
Presentation based on resources from the 2016 edition of the course (https://github.com/kbalog/uis-dat630-fall2016) and the resources shared by the authors of the book used through the course (https://www-users.cs.umn.edu/~kumar001/dmbook/index.php).
Please cite, link to or credit this presentation when using it or part of it in your work.
Date: September 18, 2017
Course: UiS DAT630 - Web Search and Data Mining (fall 2017) (https://github.com/kbalog/uis-dat630-fall2017)
Presentation based on resources from the 2016 edition of the course (https://github.com/kbalog/uis-dat630-fall2016) and the resources shared by the authors of the book used through the course (https://www-users.cs.umn.edu/~kumar001/dmbook/index.php).
Please cite, link to or credit this presentation when using it or part of it in your work.
Date: September 11, 2017
Course: UiS DAT630 - Web Search and Data Mining (fall 2017) (https://github.com/kbalog/uis-dat630-fall2017)
Presentation based on resources from the 2016 edition of the course (https://github.com/kbalog/uis-dat630-fall2016) and the resources shared by the authors of the book used through the course (https://www-users.cs.umn.edu/~kumar001/dmbook/index.php).
Please cite, link to or credit this presentation when using it or part of it in your work.
Date: March 9, 2016
Course: UiS DAT911 - Foundations of Computer Science (fall 2016)
Please cite, link to or credit this presentation when using it or part of it in your work.
Date: March 2, 2016
Course: UiS DAT911 - Foundations of Computer Science (fall 2016)
Please cite, link to or credit this presentation when using it or part of it in your work.
Priones, definiciones y la enfermedad de las vacas locasalexandrajunchaya3
Durante este trabajo de la doctora Mar junto con la coordinadora Hidalgo, se presenta un didáctico documento en donde repasaremos la definición de este misterio de la biología y medicina. Proteinas que al tener una estructura incorrecta, pueden esparcir esta estructura no adecuada, generando huecos en el cerebro, de esta manera creando el tejido espongiforme.
Date: October 2nd, 2017
Venue: Amsterdam, The Netherlands. The 2017 ACM SIGIR International Conference on Theory of Information Retrieval (ICTIR '17)
Corresponding article: https://arxiv.org/abs/1708.08291
Please cite, link to or credit this presentation when using it or part of it in your work.
Learning-to-Rank Target Types for Entity-Bearing QueriesDarío Garigliotti
Date: October 1st, 2017
Venue: Amsterdam, The Netherlands. LEARNER 2017, co-located with the 2017 ACM SIGIR International Conference on Theory of Information Retrieval (ICTIR '17)
Corresponding article: http://ceur-ws.org/Vol-2007/LEARNER2017_short_3.pdf
Please cite, link to or credit this presentation when using it or part of it in your work.
Date: March 13, 2017
Venue: Stavanger, Norway. Doctoral Seminar at the IAI group for the research visit of Prof. Maarten de Rijke
Please cite, link to or credit this presentation when using it or part of it in your work.
Date: October 7, 2016
Venue: Stavanger, Norway. Technical talk at UiS TN-IDE
Please cite, link to or credit this presentation when using it or part of it in your work.
Date: June 14, 2016
Venue: Oslo, Norway. Doctoral Seminar at HiOA
Please cite, link to or credit this presentation when using it or part of it in your work.
Date: June 10, 2016
Venue: Stavanger, Norway. Doctoral Seminar at the IAI group for the research visit of Prof. Kalervo Järvelin
Please cite, link to or credit this presentation when using it or part of it in your work.
Date: March 4, 2016
Venue: Trondheim, Norway. Doctoral Seminar at NTNU
Please cite, link to or credit this presentation when using it or part of it in your work.
Date: March 3rd, 2016
Venue: Trondheim, Norway. Doctoral Seminar at NTNU
Please cite, link to or credit this presentation when using it or part of it in your work.
Original title in Spanish: Si ésta es la respuesta, ¿cuál era la pregunta?
Date: November 20, 2013
Venue: Córdoba, Argentina. Project on Question Generation for the MSc Specialization Course "Natural Language Processing" (Faculty of Mathematics, Astronomy, Physics and Computation, National University of Córdoba)
Please cite, link to or credit this presentation when using it or part of it in your work.
Semi-supervised Learning for Word Sense DisambiguationDarío Garigliotti
Original title in Spanish: Desambiguación de Palabras Polisémicas mediante Aprendizaje Semi-supervisado
Date: September 20, 2013
Venue: Córdoba, Argentina. 42nd JAIIO - Argentine Journals of Informatics and Operating Research (JAIIO '13)
Please cite, link to or credit this presentation when using it or part of it in your work.
Date: August 2016
Venue: Saratov, Russian Federation. The 10th Russian Summer School in Information Retrieval (RuSSIR '16)
Please cite, link to or credit this presentation when using it or part of it in your work.
Semi-supervised Learning for Word Sense DisambiguationDarío Garigliotti
Original title in Spanish: Desambiguación de Palabras Polisémicas mediante Aprendizaje Semi-supervisado
Date: September 2013
Venue: Córdoba, Argentina. 42nd JAIIO - Argentine Journals of Informatics and Operating Research (JAIIO '13)
Corresponding article: https://arxiv.org/abs/1908.09641
Please cite the paper, and link to or credit this presentation when using it or part of it in your work.
Hierarchical clustering builds clusters hierarchically, by either merging or splitting clusters at each step. Agglomerative hierarchical clustering starts with each point as a separate cluster and successively merges the closest clusters based on a defined proximity measure between clusters. This results in a dendrogram showing the nested clustering structure. The basic algorithm computes a proximity matrix, then repeatedly merges the closest pair of clusters and updates the matrix until all points are in one cluster.
The document discusses several alternative classification techniques including rule-based classifiers, nearest neighbors classifiers, and Naive Bayes classifiers. It provides examples of how each technique works and some key aspects to consider, such as how to build rule-based classifiers directly from data or indirectly from other models like decision trees. It also covers concepts like mutual exclusivity of rules, rule coverage and accuracy, and how to order rules.
Date: September 25, 2017
Course: UiS DAT630 - Web Search and Data Mining (fall 2017) (https://github.com/kbalog/uis-dat630-fall2017)
Presentation based on resources from the 2016 edition of the course (https://github.com/kbalog/uis-dat630-fall2016) and the resources shared by the authors of the book used through the course (https://www-users.cs.umn.edu/~kumar001/dmbook/index.php).
Please cite, link to or credit this presentation when using it or part of it in your work.
Date: September 18, 2017
Course: UiS DAT630 - Web Search and Data Mining (fall 2017) (https://github.com/kbalog/uis-dat630-fall2017)
Presentation based on resources from the 2016 edition of the course (https://github.com/kbalog/uis-dat630-fall2016) and the resources shared by the authors of the book used through the course (https://www-users.cs.umn.edu/~kumar001/dmbook/index.php).
Please cite, link to or credit this presentation when using it or part of it in your work.
Date: September 11, 2017
Course: UiS DAT630 - Web Search and Data Mining (fall 2017) (https://github.com/kbalog/uis-dat630-fall2017)
Presentation based on resources from the 2016 edition of the course (https://github.com/kbalog/uis-dat630-fall2016) and the resources shared by the authors of the book used through the course (https://www-users.cs.umn.edu/~kumar001/dmbook/index.php).
Please cite, link to or credit this presentation when using it or part of it in your work.
Date: March 9, 2016
Course: UiS DAT911 - Foundations of Computer Science (fall 2016)
Please cite, link to or credit this presentation when using it or part of it in your work.
Date: March 2, 2016
Course: UiS DAT911 - Foundations of Computer Science (fall 2016)
Please cite, link to or credit this presentation when using it or part of it in your work.
Priones, definiciones y la enfermedad de las vacas locasalexandrajunchaya3
Durante este trabajo de la doctora Mar junto con la coordinadora Hidalgo, se presenta un didáctico documento en donde repasaremos la definición de este misterio de la biología y medicina. Proteinas que al tener una estructura incorrecta, pueden esparcir esta estructura no adecuada, generando huecos en el cerebro, de esta manera creando el tejido espongiforme.
El documento publicado por el Dr. Gabriel Toro aborda los priones y las enfermedades relacionadas con estos agentes infecciosos. Los priones son proteínas mal plegadas que pueden inducir el plegamiento incorrecto de otras proteínas normales en el cerebro, llevando a enfermedades neurodegenerativas mortales. El Dr. Toro examina tanto la estructura y función de los priones como su capacidad para propagarse y causar enfermedades devastadoras como la enfermedad de Creutzfeldt-Jakob, la encefalopatía espongiforme bovina (conocida como "enfermedad de las vacas locas"), y el síndrome de Gerstmann-Sträussler-Scheinker. En el documento, se exploran los mecanismos moleculares detrás de la replicación de los priones, así como las implicaciones para la salud pública y la investigación en tratamientos potenciales. Además, el Dr. Toro analiza los desafíos y avances en el diagnóstico y manejo de estas enfermedades priónicas, destacando la necesidad de una mayor comprensión y desarrollo de terapias eficaces.
18.
[…] En este caso, la causa
de los movimientos sísmicos
es la acción de una base
de misiles nucleares.[...]
3 La (((no) muy) larga) etapa de preprocesamiento
En en SPS00 1
este este DD0MS0 0.956743
caso caso NCMS000 0.990741
, , Fc 1
la el DA0FS0 0.972146
causa causa NCFS000 0.794872
de de SPS00 0.999919
los el DA0MP0 0.97623
movimientos movimiento NCMP000 1
sísmicos sísmico AQ0MP0 1
es ser VSIP3S0 1
la el DA0FS0 0.972146
acción acción NCFS000 1
de de SPS00 0.999919
una uno DI0FS0 0.951241
base base NCCS000 0.955882
de de SPS00 0.999919
misiles misil NCMP000 1
nucleares nuclear AQ0CP0 1
. . Fp 1
caso caso NCMS000 0.990741
causa causa NCFS000 0.794872
movimientos movimiento NCMP000 1
sísmicos sísmico AQ0MP0 1
acción acción NCFS000 1
base base NCCS000 0.955882
misiles misil NCMP000 1
nucleares nuclear AQ0CP0 1
. . Fp 1
m
ovim
iento
→ POStagging →
tener
hacer
acci
ó
n
caso
base
s
ísm
ico
causa
.... .... .... .... … …
1 0 0 ...... 1 ....... 1 ..... 1 ..... 1 .... 1 ....
←
Filtro
por
palabras
de
← contenido
→ Construir lexicon + tuplas:
20.
4 El algoritmo de listas de decisión
● Colocación: ej 'mundo'
● Evidencia E: ej “la palabra
'mundo' ocurre en la oración”
● Etiquetado inicial: ejemplos a
mano vs colocaciones semilla
● Para regla (E A)→ , confiabilidad
de que la evidencia E determine
el sentido A = C(E, A) =
=
● Aceptación de reglas:
confiabilidad > 0.95
cobertura = # evidencia > 0
nro deoraciones tq E y A
nrode oracionestq E y Ao B
21.
4 El algoritmo de listas...
0
500
1000
1500
2000
2500
3000
1 2 3 4 5 6
Cantidadesdereglas
Numero de iteracion
Proporcion de reglas aceptadas y rechazadas por iteracion
Palabra target: 'interes'
Nro_aceptadas
Nro_rechazadas_por_cobertura
Nro_rechazadas_por_probabilidad
22.
0
2000
4000
6000
8000
10000
12000
14000
0 1 2 3 4 5 6
Sizesdelossubconjuntos
Numero de iteracion
Proporcion de subconjuntos de ejemplos por iteracion
Palabra target: 'interes'
Size_set_A
Size_set_B
Size_set_No_labeled
4 El algoritmo de listas...
36.
5 Evaluación y resultados
● Evaluación bananadoor:
Enfoque simple: una palabra target en realidad proviene de reemplazar
sus diferentes sentidos o definiciones
● “...por su naturaleza humana, ...” ← “...por su índole humana, ...”
● “...comer una manzana...” ← “...comer un fruto del Malus domestica,
de forma globosa algo hundida por los extremos del eje, de
epicarpio delgado, liso y de color verde claro, amarillo pálido o
encarnado, mesocarpio con sabor acídulo o ligeramente
azucarado, y semillas pequeñas, de color de caoba, encerradas
en un endocarpio coriáceo....”
Reemplazamos en corpus toda 'vida' o 'ciudad' por target 'vidaciudad'
Hacemos preprocesamiento (info inicial, filtrado...) + algoritmo
Evaluación bananadoor