Filter Results
:
(835)
Show Results For
-
All HBS Web
(835)
- News (77)
- Research (638)
- Events (11)
- Multimedia (4)
- Faculty Publications (633)
Show Results For
-
All HBS Web
(835)
- News (77)
- Research (638)
- Events (11)
- Multimedia (4)
- Faculty Publications (633)
- November 2021
- Article
Gaussian Process Subset Scanning for Anomalous Pattern Detection in Non-iid Data
By: William Herlands, Edward McFowland III, Andrew Gordon Wilson and Daniel B. Neill
Identifying anomalous patterns in real-world data is essential for understanding where, when, and how systems deviate from their expected dynamics. Yet methods that separately consider the anomalousness of each individual data point have low detection power for subtle,...
View Details
Herlands, William, Edward McFowland III, Andrew Gordon Wilson, and Daniel B. Neill. "Gaussian Process Subset Scanning for Anomalous Pattern Detection in Non-iid Data." Proceedings of Machine Learning Research (PMLR) 84 (2018): 425–434. (Also presented at the 21st International Conference on Artificial Intelligence and Statistics (AISTATS), 2018.)
- 2016
- Article
Penalized Fast Subset Scanning
By: Skyler Speakman, Sriram Somanchi, Edward McFowland III and Daniel B. Neill
We present the penalized fast subset scan (PFSS), a new and general framework for scalable and accurate pattern detection. PFSS enables exact and efficient identification of the most anomalous subsets of the data, as measured by a likelihood ratio scan statistic....
View Details
Keywords:
Disease Surveillance;
Likelihood Ratio Statistic;
Pattern Detection;
Scan Statistic;
Mathematical Methods
Speakman, Skyler, Sriram Somanchi, Edward McFowland III, and Daniel B. Neill. "Penalized Fast Subset Scanning." Journal of Computational and Graphical Statistics 25, no. 2 (2016): 382–404. (Selected for “Best of JCGS” invited session by the journal’s editor in chief.)
- 2013
- Article
Beyond Alternating Permutations: Pattern Avoidance in Young Diagrams and Tableaux
By: Nihal Gowravaram and Ravi Jagadeesan
We investigate pattern avoidance in alternating permutations and generalizations thereof. First, we study pattern avoidance in an alternating analogue of Young diagrams. In particular, we extend Babson-West’s notion of shape-Wilf equivalence to apply to alternating...
View Details
Keywords:
Pattern Avoidance;
Alternating Permutations;
Descent Type Permutations;
Wilf Equivalence;
Shape-Wilf Equivalence;
Mathematical Methods
Gowravaram, Nihal, and Ravi Jagadeesan. "Beyond Alternating Permutations: Pattern Avoidance in Young Diagrams and Tableaux." #P17. Electronic Journal of Combinatorics 20, no. 4 (2013).
- Article
Hinged Dissections Exist
By: Timothy G. Abbott, Zachary Abel, David Charlton, Erik D. Demaine, Martin L. Demaine and Scott Duke Kominers
We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged at vertices that can be folded in the plane continuously without self-intersection to form...
View Details
Abbott, Timothy G., Zachary Abel, David Charlton, Erik D. Demaine, Martin L. Demaine, and Scott Duke Kominers. "Hinged Dissections Exist." Discrete & Computational Geometry 47, no. 1 (January 2012): 150–186.
- 2009
- Article
On Universal Binary Hermitian Forms
Earnest and Khosravani, Iwabuchi, and Kim and Park recently gave a complete classification of the universal binary Hermitian forms. We give a unified proof of the universalities of these Hermitian forms, relying upon Ramanujan's list of universal quadratic forms...
View Details
Keywords:
Mathematical Methods
Kominers, Scott Duke. "On Universal Binary Hermitian Forms." A02. INTEGERS: Electronic Journal of Combinatorial Number Theory 9 (2009): 9–15.
- May 2009
- Article
Configurations of Extremal Even Unimodular Lattices
We extend the results of Ozeki on the configurations of extremal even unimodular lattices. Specifically, we show that if L is such a lattice of rank 56, 72, or 96, then L is generated by its minimal-norm vectors.
View Details
Keywords:
Mathematical Methods
Kominers, Scott Duke. "Configurations of Extremal Even Unimodular Lattices." International Journal of Number Theory 5, no. 3 (May 2009): 457–464.
- 2010
- Article
On the Classification of Type II Codes of Length 24
By: Noam D. Elkies and Scott Duke Kominers
We give a new, purely coding-theoretic proof of Koch's criterion on the tetrad systems of Type II codes of length 24 using the theory of harmonic weight enumerators. This approach is inspired by Venkov's approach to the classification of the root systems of Type II...
View Details
Keywords:
Mathematical Methods
Elkies, Noam D., and Scott Duke Kominers. "On the Classification of Type II Codes of Length 24." SIAM Journal on Discrete Mathematics 23, no. 4 (2010).
- March 2010
- Article
Further Improvements of Lower Bounds for the Least Common Multiples of Arithmetic Progressions
By: Shaofang Hong and Scott Duke Kominers
For relatively prime positive integers u_0 and r, we consider the arithmetic progression {u_k := u_0+k*r} (0 <= k <= n). Define L_n := lcm{u_0,u_1,...,u_n} and let a >= 2 be any integer. In this paper, we show that, for integers alpha,r >= a and n >=...
View Details
Keywords:
Mathematical Methods
Hong, Shaofang, and Scott Duke Kominers. "Further Improvements of Lower Bounds for the Least Common Multiples of Arithmetic Progressions." Proceedings of the American Mathematical Society 138, no. 3 (March 2010): 809–813.
- August 2005 (Revised April 2008)
- Teaching Note
GuestFirst Hotel (B): Statistics Review with Data Desk (TN)
By: Frances X. Frei
Presents an overview of the statistical analysis covered in the case discussion.
View Details
- March 2004
- Teaching Note
Variance Analysis Tutorial (Instructor Guide)
By: David F. Hawkins
Instructor Guide to (9-104-709).
View Details
Keywords:
Mathematical Methods
- October 1979 (Revised March 1995)
- Background Note
Note on the Management of Queues
Contains four sections: 1) measuring the performance of queuing systems; 2) types of queuing systems; 3) the behavior of simple systems (elementary queuing theory); and 4) the management of queues (including a discussion of their psychology).
View Details
Keywords:
Mathematical Methods
Maister, David H. "Note on the Management of Queues." Harvard Business School Background Note 680-053, October 1979. (Revised March 1995.)
- 1997
- Chapter
On the Role of the Wiener Process in Finance Theory and Practice: The Case of Replicating Portfolios
By: Robert C. Merton
Keywords:
Mathematical Methods
Merton, Robert C. "On the Role of the Wiener Process in Finance Theory and Practice: The Case of Replicating Portfolios." In The Legacy of Norbert Wiener: A Centennial Symposium. Vol. 60, edited by D. Jerison, I. M. Singer, and D. W. Stroock. Proceedings of Symposia in Pure Mathematics . Providence, RI: American Mathematical Society, 1997.
- Career Coach
Wendi Zhang
development policies and analysis in the public sector. Wendi attended the Massachusetts Institute of Technology, where she received Bachelor of Science degrees in both Mathematics and Management Science, along with minors in Economics...
View Details
Parker Treacy
Competition in 2016, becoming the first Latin American startup to receive the award. In 2019, Cobli was elected by LinkedIn as one of the top ten startups in Brazil. Previously, Parker founded First Help Financial, the tenth largest independent vehicle finance company...
View Details
- 01 Dec 1997
- News
Merton's Economics Research Wins Nobel Prize
evaluation began when he was a graduate student in applied mathematics at the California Institute of Technology and intensified in the late 1960s, when he went to MIT to study economics under Nobel Laureate Paul Samuelson. At MIT, he...
View Details
- 01 Dec 1997
- News
"Economists are puzzle solvers..."
(I've always been a car buff!) when I was ten. I can remember going with my dad to the stockbroker's and sitting there watching the NYSE and AMEX tapes, learning all the companies' symbols. And when I was in graduate school in applied View Details
- Article
Preventing Fairness Gerrymandering: Auditing and Learning for Subgroup Fairness
By: Michael J Kearns, Seth Neel, Aaron Leon Roth and Zhiwei Steven Wu
The most prevalent notions of fairness in machine learning are statistical definitions: they fix a small collection of pre-defined groups, and then ask for parity of some statistic of the classifier (like classification rate or false positive rate) across these groups....
View Details
Kearns, Michael J., Seth Neel, Aaron Leon Roth, and Zhiwei Steven Wu. "Preventing Fairness Gerrymandering: Auditing and Learning for Subgroup Fairness." Proceedings of the International Conference on Machine Learning (ICML) 35th (2018).
- 2020
- Working Paper
Design and Analysis of Switchback Experiments
By: Iavor I Bojinov, David Simchi-Levi and Jinglong Zhao
In switchback experiments, a firm sequentially exposes an experimental unit to a random treatment, measures its response, and repeats the procedure for several periods to determine which treatment leads to the best outcome. Although practitioners have widely adopted...
View Details
Bojinov, Iavor I., David Simchi-Levi, and Jinglong Zhao. "Design and Analysis of Switchback Experiments." Harvard Business School Working Paper, No. 21-034, September 2020.
- October 1992
- Case
Charles River Jazz Festival
Charles River Jazz Festival must decide whether to press a compact disk (CD) of Friday's jazz performance for sale on Saturday and Sunday. The idea to press CDs is novel, so there is considerable uncertainty about how receptive customers will be. The festival must...
View Details
Wu, George. "Charles River Jazz Festival." Harvard Business School Case 893-004, October 1992.