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

Steve Vejcik

dblp:01/1095 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2010
—ORCID · none

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

Artificial intelligence and machine learning · 2Databases, data management, data science and information retrieval · 2Systems, architecture and hardware · 1Software engineering, systems software and programming languages · 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
2 papers
Data mining · 83% Query processing and optimization · 8% Data models and query languages · 8%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 50% Cloud and datacenter computing · 50%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Smart cities and intelligent transportation · 100%

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

TopicWeightPapersLastEvidence papers
Data mining
anomaly detection
0.122007
Detecting changes in large data sets of payment card data: a case study · KDD 2007
Real Time Change Detection and Alerts from Highway Traffic Data · SC 2005
Performance modeling and evaluation
benchmarking
0.112010
Malstone: towards a benchmark for analytics on large data clouds · KDD 2010
Data mining › time series analysis
change point detection
0.112007
Detecting changes in large data sets of payment card data: a case study · KDD 2007
Smart cities and intelligent transportation
traffic monitoring
0.112005
Real Time Change Detection and Alerts from Highway Traffic Data · SC 2005
Query processing and optimization › OLAP
data cube
0.012007
Detecting changes in large data sets of payment card data: a case study · KDD 2007
Data models and query languages
multidimensional data
0.012007
Detecting changes in large data sets of payment card data: a case study · KDD 2007
Data mining
pattern mining
0.012005
Real Time Change Detection and Alerts from Highway Traffic Data · SC 2005

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

baseline modeling · 0.2synthetic data generation · 0.1benchmark design · 0.1feature vector scoring · 0.1change detection · 0.1
YearPublicationVenuePosition
2010 Malstone: towards a benchmark for analytics on large data clouds
abstract
Developing data mining algorithms that are suitable for cloud computing platforms is currently an active area of research, as is developing cloud computing platforms appropriate for data mining. Currently, the most common benchmark for cloud computing is the Terasort (and related) benchmarks. Although the Terasort Benchmark is quite useful, it was not designed for data mining per se. In this paper, we introduce a benchmark called MalStone that is specifically designed to measure the performance of cloud computing middleware that supports the type of data intensive computing common when building data mining models. We also introduce MalGen, which is a utility for generating data on clouds that can be used with MalStone.
Collin Bennett, Robert L. Grossman, David Locke, Jonathan Seidman, Steve Vejcik
KDD5
2007 Detecting changes in large data sets of payment card data: a case study
abstract
An important problem in data mining is detecting changes in large datasets. Although there are a variety of change detection algorithms that have been developed, in practice it can be a problem to scale these algorithms to large data sets due to the heterogeneity of the data. In this paper, we describe a case study involving payment card data in which we built and monitored a separate change detection model for each cell in a multi-dimensional data cube. We describe a system that has been in operation for the past two years that builds and monitors over 15,000 separate baseline models and the process that isused for generating and investigating alerts using these baselines.
Chris Curry, Robert L. Grossman, David Locke, Steve Vejcik, Joseph Bugajski
KDD4
2006 A Service Oriented Architecture Supporting Data Interoperability for Payments Card Processing Systems
Joseph Bugajski, Robert L. Grossman, Steve Vejcik
ICSOC3
2005 Real Time Change Detection and Alerts from Highway Traffic Data
abstract
We developed a testbed containing: real time data from over 830 highway traffic sensors in the Chicago region, data about weather, and text data about events that might affect traffic. The goal was to detect in real time interesting changes in traffic conditions. Given the size and complexity of the data, we choose to build a large number of separate baseline models. We built a separate baseline for each hour in the day, for each day in the week, and for every 2 or 3 traffic sensors, resulting in over 42,000 separate baseline models. We also built a baseline engine to build the necessary baselines automatically. We modified an open source scoring engine to process in real time each new sensor reading, update the appropriate feature vectors, score the updated feature vectors using the baseline models, and send out real time alerts when deviations from the baselines were detected.
Robert L. Grossman, Michal Sabala, Anushka Anand, Steve Eick, Leland Wilkinson, John Chaves, Steve Vejcik, John F. Dillenburg, Peter C. Nelson, Doug Rorem, Javid Alimohideen, Jason Leigh, Michael E. Papka, Rick L. Stevens
SC8