A5048338565- Information Retrieval and Search Behavior
- Topic Modeling
- Complex Network Analysis Techniques
- Logic, Reasoning, and Knowledge
- Advanced Text Analysis Techniques
- Semantic Web and Ontologies
- Algorithms and Data Compression
- Sentiment Analysis and Opinion Mining
- Web Data Mining and Analysis
- Data Management and Algorithms
- Advanced Algebra and Logic
- Data Quality and Management
- Natural Language Processing Techniques
- Machine Learning and Algorithms
- Opinion Dynamics and Social Influence
- Computability, Logic, AI Algorithms
- Logic, programming, and type systems
- Graph Theory and Algorithms
- Multi-Agent Systems and Negotiation
- Text and Document Classification Technologies
- Advanced Image and Video Retrieval Techniques
- Advanced Database Systems and Queries
- Image Retrieval and Classification Techniques
- Recommender Systems and Techniques
- Opportunistic and Delay-Tolerant Networks
Fondazione "Ugo Bordoni"
2010-2024
University of Milan
2015
University of L'Aquila
2011
University of Glasgow
1999-2005
Sapienza University of Rome
1987-1997
We introduce and create a framework for deriving probabilistic models of Information Retrieval. The are nonparametric IR obtained in the language model approach. derive term-weighting by measuring divergence actual term distribution from that under random process. Among processes we study binomial Bose--Einstein statistics. define two types frequency normalization tuning weights document--query matching first assumes documents have same length measures information gain with observed once it...
We study Sowa's conceptual graphs (CGs) with both existential and universal quantifiers. explore in detail the fragment. extend modify original graph derivation system new rules prove soundness completeness theorem respect to standard interpretation of CGs into first order logic (FOL). The proof is obtained by reducing a question-answering problem. can be equivalently querying Definite Horn Clauses program conjunction positive atoms. Moreover, provides an algorithm for pure proof-theoretic...
We present the results of our exploratory analysis on relationship that exists between relevance and time. observe how amount documents published in a given interval time is related to probability relevance, and, using series analysis, we show existence correlation relevance. As an initial application this study query expansion exploiting detection publication peaks over Blog06 collection. finally propose effective approach for blog search domain. Our based trend being so completely...
Freshness of information in real-time search is central social networks, news, blogs and micro-blogs. Nevertheless, there not a clear experimental evidence that shows what principled approach effectively combines time content.
We present a general proof theoretical methodology for default systems. Given theory W, D, the rules D are simply understood as restrictions on tableaux construction of logic. Different approaches approch (such Reiter, Brewka or Lukaszewicz), allowable extensions can be obtained from tableau construction. The advantage our approach, besides being simple and neat, is in its generality: it allows development any logic with formulation, such intuitionistic logic, linear modal