Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Raz Tamir

dblp:89/678 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2017
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 2 first-authorDatabases, data management, data science and information retrieval · 3 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Computational photography and imaging · 100%
Databases, data mining, and information retrieval
3 papers
Data mining · 53% Information retrieval · 30% Recommender systems · 17%
Artificial intelligence
1 paper
Information extraction and text analysis · 100%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational photography and imaging › underwater imaging
underwater image formation
0.312017
What is the Space of Attenuation Coefficients in Underwater Computer Vision? · CVPR 2017
Computational photography and imaging
image formation
0.112017
What is the Space of Attenuation Coefficients in Underwater Computer Vision? · CVPR 2017
Data mining › pattern mining
association rule mining
0.112006
On a confidence gain measure for association rule discovery and scoring · VLDB J. 2006
Data mining › pattern mining › association rule mining
interestingness measures
0.112006
On a confidence gain measure for association rule discovery and scoring · VLDB J. 2006
Information retrieval › query reformulation
query expansion
0.112005
A Random Walk through Human Associations · ICDM 2005
Recommender systems
user profiling
0.112005
A Random Walk through Human Associations · ICDM 2005
Natural language and speech › Information extraction and text analysis
word sense disambiguation
0.012003
Mining the Web to Discover the Meanings of an Ambiguous Word · ICDM 2003
Data mining › statistical analysis
co-occurrence statistics
0.012003
Mining the Web to Discover the Meanings of an Ambiguous Word · ICDM 2003
Information retrieval › text analysis › lexical semantics
word sense induction
0.012003
Mining the Web to Discover the Meanings of an Ambiguous Word · ICDM 2003

Methods — techniques the papers use, named apart from their topics

ocean optical measurement prior · 0.3manifold fitting · 0.3confidence gain · 0.1co-occurrence analysis · 0.1random walk · 0.1local confidence gain · 0.1association rule mining · 0.1
YearPublicationVenuePosition
2017 What is the Space of Attenuation Coefficients in Underwater Computer Vision?
abstract
Underwater image reconstruction methods require the knowledge of wideband attenuation coefficients per color channel. Current estimation methods for these coefficients require specialized hardware or multiple images, and none of them leverage the multitude of existing ocean optical measurements as priors. Here, we aim to constrain the set of physically-feasible wideband attenuation coefficients in the ocean by utilizing water attenuation measured worldwide by oceanographers. We calculate the space of valid wideband effective attenuation coefficients in the 3D RGB domain and find that a bound manifold in 3-space sufficiently represents the variation from the clearest to murkiest waters. We validate our model using in situ experiments in two different optical water bodies, the Red Sea and the Mediterranean. Moreover, we show that contradictory to the common image formation model, the coefficients depend on the imaging range and object reflectance, and quantify the errors resulting from ignoring these dependencies.
Derya Akkaynak, Tali Treibitz, Tom Shlesinger, Yossi Loya, Raz Tamir, David Iluz
CVPR5
2006 On a confidence gain measure for association rule discovery and scoring
Raz Tamir, Yehuda Singer
VLDB J.1
2005 A Random Walk through Human Associations
abstract
Letting one's thoughts wander is not simply an arbitrary or rambling process. It can better be described as "associative thinking", where a complex chain of associative thoughts and ideas are linked. It is our contention that this seemingly chaotic process can be modeled by a random walk in a weighted directed graph. Furthermore, is it possible to predict mathematically the "steady state" of such a process, to determine where such wandering is leading. The random walk process uses rules of association, defined by the Local Confidence Gain (LCG) interestingness measure. Extracted concepts are used as nodes of a directed graph. The associative "forces" between any two concepts (measured by LCG) are used to weigh the edges connecting the nodes that create a graph of associations. It is common, yet not trivial, for people to look for data about a subject without knowing its exact nomenclature (for example, finding the name of a disease just by knowing its symptoms). Random walk in association graphs can discover highly informative phrases that can be used for query expansion in a way that better expresses the user's initial search goals. A different usage is to create a user profile representing his current interests. We used a modified version of the Turing Test to show that the random walk process discovers association rules that conform to a human associations generating process. By constructing the user associations we were able to build a profile representing the user's "line of thoughts". The suggested algorithm can be used in any database and can implement the ranking measures of other association rules.
Raz Tamir
ICDM1
2003 Mining the Web to Discover the Meanings of an Ambiguous Word
abstract
In information retrieval and text mining, information on word senses is usually taken from dictionaries or lexical databases that have been prepared by lexicographers. We propose an automatic method for word sense induction, i.e. for the discovery of a set of sense descriptors to a given ambiguous word. The approach is based on the statistics of word co-occurrence as derived from Web pages. The underlying assumption is that the senses of an ambiguous word are best described by terms that, although bearing a strong association to this word, are mutually exclusive, i.e. whose association strength within the retrieved Web pages is as weak as possible. Measuring association strength is based upon a novel confidence gain approach that relates the observed co-occurrence frequency for two sense descriptor candidates to an average co-occurrence frequency for pairs of arbitrary words. The proposed approach is fully unsupervised and takes into account the contemporary meanings of words, as reflected in texts from the Internet. Our results are evaluated using a list of ambiguous words commonly referred to in the literature.
Raz Tamir, Reinhard Rapp
ICDM1