Fetching the paper…
Reading the bibliography…
In this paper, we study feature cross search as a fundamental primitive in feature engineering.
A useful convergence theorem for probability distributions
Henry Scheffé · 1947
Earlier work this paper cites.
An analysis of approximations for maximizing submodular set functions—i
George L Nemhauser, Laurence A Wolsey, and Marshall L Fisher · 1978
Earlier work this paper cites.
Machine Learning
Tom Mitchell · 1997
Earlier work this paper cites.
Distributional clustering of words for text classification
L Douglas Baker and Andrew Kachites McCallum · 1998
Earlier work this paper cites.
On the complexity of k-sat
Russell Impagliazzo and Ramamohan Paturi · 2001
Earlier work this paper cites.
The power of word clusters for text classification
Noam Slonim and Naftali Tishby · 2001
Earlier work this paper cites.
Feature selection for svms
Jason Weston, Sayan Mukherjee, Olivier Chapelle, Massimiliano Pontil, Tomaso Poggio, and Vladimir Vapnik · 2001
Earlier work this paper cites.
Input feature selection by mutual information based on parzen window
Nojun Kwak and Chong-Ho Choi · 2002
Earlier work this paper cites.
High-performing feature selection for text classification
Monica Rogati and Yiming Yang · 2002
Earlier work this paper cites.
A divisive information-theoretic feature clustering algorithm for text classification
Inderjit S Dhillon, Subramanyam Mallela, and Rahul Kumar · 2003
Earlier work this paper cites.
On the naive bayes model for text categorization
Susana Eyheramendy, David D Lewis, and David Madigan · 2003
Earlier work this paper cites.
An introduction to variable and feature selection
Isabelle Guyon and André Elisseeff · 2003
Earlier work this paper cites.
Near-optimal nonmyopic value of information in graphical models
Andreas Krause and Carlos Guestrin · 2005
Cited alongside, same era.
Near-optimal sensor placements: Maximizing information while minimizing communication cost
Andreas Krause, Carlos Guestrin, Anupam Gupta, and Jon Kleinberg · 2006
Cited alongside, same era.
A course in approximation theory , volume 101
Elliott Ward Cheney and William Allan Light · 2009
Cited alongside, same era.
Analysis of naive bayes’ assumptions on software fault data: An empirical study
Burak Turhan and Ayse Bener · 2009
Cited alongside, same era.
Detecting high log-densities: an o ( n 1 / 4 ) o(n^{1/4}) approximation for densest k-subgraph
Aditya Bhaskara, Moses Charikar, Eden Chlamtac, Uriel Feige, and Aravindan Vijayaraghavan · 2010
Cited alongside, same era.
Efficient and robust feature selection via joint ℓ 2 , 1 \ell_{2,1} -norms minimization
Sequential information maximization: When is greedy near-optimal?
Yuxin Chen, S Hamed Hassani, Amin Karbasi, and Andreas Krause · 2015
Later among the works it cites.
Submodularity in data subset selection and active learning
Kai Wei, Rishabh Iyer, and Jeff Bilmes · 2015
Later among the works it cites.
A note on the use of empirical auc for evaluating probabilistic forecasts
Simon Byrne · 2016
Later among the works it cites.
Influence maximization in messenger-based social networks
Yuanxing Zhang, Yichong Bai, Lin Chen, Kaigui Bian, and Xiaoming Li · 2016
Later among the works it cites.
Almost-polynomial ratio eth-hardness of approximating densest k-subgraph
Pasin Manurangsi · 2017
Later among the works it cites.
Scalable feature selection via distributed diversity maximization
Sepehr Abbasi Zadeh, Mehrdad Ghadiri, Vahab Mirrokni, and Morteza Zadimoghaddam · 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Feiping Nie, Heng Huang, Xiao Cai, and Chris H Ding · 2010
Cited alongside, same era.
Submodularity in natural language processing: algorithms and applications
Hui Lin · 2012
Cited alongside, same era.
Mifs-nd: A mutual information-based feature selection method
Nazrul Hoque, Dhruba K Bhattacharyya, and Jugal K Kalita · 2014
Cited alongside, same era.
Quantizer design for outputs of binary-input discrete memoryless channels using smawk algorithm
Ken-ichi Iwata and Shin-ya Ozawa · 2014
Cited alongside, same era.
Submodular function maximization
Andreas Krause and Daniel Golovin · 2014
Cited alongside, same era.
Quantization of binary-input discrete memoryless channels
Brian M Kurkoski and Hideki Yagi · 2014
Cited alongside, same era.
Later among the works it cites.
Restricted strong convexity implies weak submodularity
Ethan R Elenberg, Rajiv Khanna, Alexandros G Dimakis, and Sahand Negahban · 2018
Later among the works it cites.
Data summarization at scale: A two-stage submodular approach
Marko Mitrovic, Ehsan Kazemi, Morteza Zadimoghaddam, and Amin Karbasi · 2018
Later among the works it cites.
Categorical feature compression via submodular optimization
Mohammadhossein Bateni, Lin Chen, Hossein Esfandiari, Thomas Fu, Vahab Mirrokni, and Afshin Rostamizadeh · 2019
Later among the works it cites.
Autocross: Automatic feature crossing for tabular data in real-world applications
Yuanfei Luo, Mengshuo Wang, Hao Zhou, Quanming Yao, Wei-Wei Tu, Yuqiang Chen, Wenyuan Dai, and Qiang Yang · 2019
Later among the works it cites.
Generalized linear rule models
Dennis Wei, Sanjeeb Dash, Tian Gao, and Oktay Günlük · 2019
Later among the works it cites.