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

Galit Shmueli

dblp:68/2834 · DBLP profile ↗
← Back
8ranked-venue papers
2as first author
0since 2021 · last 2008
0000-0002-0820-0301ORCID · corroborated

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

Artificial intelligence and machine learning · 4 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2Human-computer interaction and ubiquitous computing · 2Applied, interdisciplinary, general and emerging computing · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 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.

Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Artificial intelligence
1 paper
Time series and sequential data · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Time series and sequential data
ensemble forecasting
0.112008
Ensemble Forecasting for Disease Outbreak Detection · AAAI 2008
Medical and health informatics › public health › public health informatics
outbreak detection
0.112008
Ensemble Forecasting for Disease Outbreak Detection · AAAI 2008
Data mining › predictive modeling
forecasting
0.112006
Dynamic, real-time forecasting of online auctions via functional models · KDD 2006
Data mining › statistical analysis
functional data analysis
0.112006
Dynamic, real-time forecasting of online auctions via functional models · KDD 2006

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

ensemble forecasting · 0.2velocity and acceleration features · 0.1functional data model · 0.1
YearPublicationVenuePosition
2008 Ensemble Forecasting for Disease Outbreak Detection
Thomas H. Lotze, Galit Shmueli
AAAI2
2008 Price formation and its dynamics in online auctions
Ravi Bapna, Wolfgang Jank, Galit Shmueli
Decis. Support Syst.3
2007 A family of growth models for representing the price process in online auctions
abstract
Bids during an online auction arrive at unequally-spaced discrete time points. Our goal is to capture the entire continuous price-evolution function by representing it as a functional object. Various nonparametric smoothing methods exist to recover the functional object from the observed discrete bid data. Previous studies use penalized polynomial and monotone smoothing splines; however, these require the determination and storage of a large number of coefficients and often lengthy computational time. We present a family of parametric growth curves that describe the price-evolution during online auctions. This approach is parsimonious and has an appealing interpretation in the online auction context. We also provide an automated fitting algorithm that is computationally fast. Methods are illustrated using eBay data.
Valerie Hyde, Wolfgang Jank, Galit Shmueli
ICEC3
2007 Similarity-Based Forecasting with Simultaneous Previews: A River Plot Interface for Time Series Forecasting
abstract
Time-series forecasting has a large number of applications. Users with a partial time series for auctions, new stock offerings, or industrial processes desire estimates of the future behavior. We present a data driven forecasting method and interface called similarity-based forecasting (SBF). A pattern matching search in an historical time series dataset produces a subset of curves similar to the partial time series. The forecast is displayed graphically as a river plot showing statistical information about the SBF subset. A forecasting preview interface allows users to interactively explore alternative pattern matching parameters and see multiple forecasts simultaneously. User testing with 8 users demonstrated advantages and led to improvements.
Paolo Buono, Catherine Plaisant, Adalberto L. Simeone, Aleks Aris, Galit Shmueli, Wolfgang Jank
IV5
2006 Dynamic, real-time forecasting of online auctions via functional models
abstract
We propose a dynamic model for forecasting price in online auctions. One of the key features of our model is that it operates during the live-auction, which makes it different from previous approaches that only consider static models. Our model is also different with respect to how information about price is incorporated. While one part of the model is based on the more traditional notion of an auction's price-level, another part incorporates its dynamics in the form of a price's velocity and acceleration. In that sense, it incorporates key features of a dynamic environment such as an online auction. The use of novel functional data methodology allows us to measure, and subsequently include, dynamic price characteristics. We illustrate our model on a diverse set of eBay auctions across many different book categories. We find significantly higher prediction accuracy compared to standard approaches.
Wolfgang Jank, Galit Shmueli
KDD2
2006 Exploring auction databases through interactive visualization
Galit Shmueli, Wolfgang Jank, Aleks Aris, Catherine Plaisant, Ben Shneiderman
Decis. Support Syst.1
2005 Representing Unevenly-Spaced Time Series Data for Visualization and Interactive Exploration
Aleks Aris, Ben Shneiderman, Catherine Plaisant, Galit Shmueli, Wolfgang Jank
INTERACT4
2003 Computing consecutive-type reliabilities nonrecursively
abstract
The reliability of consecutive-type systems has been approached from various angles. A new method is presented for deriving exact expressions for the generating functions and the reliabilities of various consecutive-type systems. This method, based on Feller's run theory, is easy to implement, and leads to both recursive and nonrecursive formulas for the reliability. The nonrecursive expression is especially advantageous for systems with numerous components. In comparison to the n (number of components) computations that the recursive formulas require, the nonrecursive formula only requires the computation of the roots of a polynomial of order k. The method is extended for computing generating functions and reliabilities of systems with multi-state components as well as systems with s-dependent components.
Galit Shmueli
IEEE Trans. Reliab.1