Fetching the paper…
Reading the bibliography…
Set functions are functions (or signals) indexed by the powerset (set of all subsets) of a finite set N.
J. L. Walsh, “A closed set of normal orthogonal functions,” American Journal of Mathematics , vol. 45, no. 1, pp. 5–24, 1923
1923
Earlier work this paper cites.
F. M. Reza, An Introduction to Information Theory . McGraw-Hill, 1961
1961
Earlier work this paper cites.
R. M. Fano, Transmission of Information . MIT Press, 1961
1961
Earlier work this paper cites.
G.-C. Rota, “On the foundations of combinatorial theory. I. theory of Möbius functions,” Z. Wahrscheinlichkeitstheorie und Verwandte Gebiete , vol. 2, no. 4, pp. 340–368, 1964
1964
Earlier work this paper cites.
M. Püschel, “A discrete signal processing framework for set functions,” in Proc. International Conference on Acoustics, Speech, and Signal Processing (ICASSP) , 2018, pp. 1935–1968
1968
Earlier work this paper cites.
R. E. Kalman, P. L. Falb, and M. A. Arbib, Topics in Mathematical System Theory . McGraw-Hill, 1969
1969
Earlier work this paper cites.
M. Aigner, Combinatorial Theory . Springer, 1979
1979
Earlier work this paper cites.
D. E. Dudgeon and R. M. Mersereau, Multidimensional Digital Signal Processing , ser. Signal Processing Series. Prentice-Hall, 1983
1983
Earlier work this paper cites.
K. Beauchamp, Applications of Walsh and related functions . Academic Press, 1984
1984
Earlier work this paper cites.
W. H. Cunningham, “On submodular function minimization,” Combinatorica , vol. 5, pp. 185–192, 1985
1985
Earlier work this paper cites.
J. Kahn, G. Kalai, and N. Linial, “The influence of variables on boolean functions,” in Proc. Foundations of Computer Science (FOCS) , 1988, pp. 68–80
1988
Earlier work this paper cites.
K. R. Rao and P. Yip, Discrete Cosine Transform: Algorithms, Advantages, Applications . Academic Press, 1990
1990
Earlier work this paper cites.
F. R. K. Chung, Spectral Graph Theory . AMS, 1997
1997
Earlier work this paper cites.
F. Nebeker, Fifty Years of Signal Processing . IEEE Signal Processing Society, 1998, https://signalprocessingsociety.org/uploads/history/history.pdf
1998
Earlier work this paper cites.
A. V. Oppenheim, R. W. Schafer, and J. R. Buck, Discrete-Time Signal Processing , 2nd ed. Prentice Hall, 1999
1999
Earlier work this paper cites.
M. Grabisch, J.-L. Marichal, and M. Roubens, “Equivalent representations of set functions,” Mathematics of Operations Research , vol. 25, no. 2, pp. 157–178, 2000
2000
Earlier work this paper cites.
C. Godsil and G. Royle, Algebraic graph theory . Springer, 2001
2001
Earlier work this paper cites.
2001
Earlier work this paper cites.
B. Peleg and P. Sudhölter, Introduction to the Theory of Cooperative Games . Kluwer Academic Publisher, 2003
2003
Earlier work this paper cites.
A. J. Bell, “the co-information lattice,” in Proc. International Symposium on Independent Component Analysis and Blind Signal Separation (ICA) , 2003
2003
Earlier work this paper cites.
A. Krause and C. Guestrin, “Near-optimal nonmyopic value of information in graphical models,” in Proc. Conference on Uncertainty in Artificial Intelligence , 2005, pp. 324–331
2005
Earlier work this paper cites.
D. C. Parkes, Iterative Combinatorial Auctions . MIT press, 2006
2006
Cited alongside, same era.
A. Björklund, T. Husfeldt, P. Kaski, and M. Koivisto, “Fourier meets Möbius: Fast subset convolution,” in Proc. Symposium on Theory of Computing (STOC) , 2007, pp. 67–74
2007
Cited alongside, same era.
A. Krause, A. Singh, and C. Guestrin, “Near-optimal sensor placements in gaussian processes: Theory, efficient algorithms and empirical studies,” Journal of Machine Learning Research , vol. 9, no. Feb, pp. 235–284, 2008
2008
Cited alongside, same era.
R. D. Wolf, A brief introduction to Fourier analysis on the Boolean cube , ser. Graduate Surveys. Theory of Computing Library, 2008, no. 1
2008
Cited alongside, same era.
M. Püschel and J. M. F. Moura, “Algebraic signal processing theory: Foundation and 1-D time,” IEEE Trans. on Signal Processing , vol. 56, no. 8, pp. 3572–3585, 2008
M.-Y. Liu, O. Tuzel, S. Ramalingam, and R. Chellappa, “Entropy-rate clustering: Cluster analysis via maximizing a submodular function subject to a matroid constraint,” IEEE Trans. on Pattern Analysis and Machine Intelligence , vol. 36, no. 1, pp. 99–112, 2014
2014
Later among the works it cites.
M. Vetterli, J. Kovačević, and V. K. Goyal, Foundations of Signal Processing . Cambridge University Press, 2014
2014
Later among the works it cites.
S. Chen, R. Varma, A. Sandryhaila, and J. Kovacevic, “Discrete signal processing on graphs: Sampling theory,” IEEE Trans. on Signal Processing , vol. 63, no. 24, pp. 6510–6523, 2015
2015
Later among the works it cites.
S. Tschiatschek, J. Djolonga, and A. Krause, “Learning probabilistic submodular diversity models via noise contrastive estimation,” in AISTATS , 2016, pp. 770–779
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2008
Cited alongside, same era.
——, “Algebraic signal processing theory: 1-D space,” IEEE Trans. on Signal Processing , vol. 56, no. 8, pp. 3586–3599, 2008
2008
Cited alongside, same era.
J. M. F. Moura, “What is signal processing?” IEEE Signal Processing Magazine , vol. 26, p. 6, 2009
2009
Cited alongside, same era.
M. H. Karcí and M. Demirekler, “Minimization of monotonically levelable higher order mrf energies via graph cuts,” IEEE Trans. on Image Processing , vol. 10, pp. 2849–2860, 2010
2010
Cited alongside, same era.
P. Stobbe and A. Krause, “Efficient minimization of decomposable submodular functions,” in Advances in Neural Information Processing Systems , 2010, pp. 2208–2216
2010
Cited alongside, same era.
H. Lin and J. Bilmes, “A class of submodular functions for document summarization,” in Proc. of Meeting of the Association for Computational Linguistics: Human Language Technologies , 2011, pp. 510–520
2011
Cited alongside, same era.
H. Zhu, N. Prasad, and S. Rangarajan, “Precoder design for physical layer multicasting,” IEEE Trans. on Signal Processing , vol. 60, no. 11, pp. 5932–5947, 2012
2012
Cited alongside, same era.
P. Stobbe and A. Krause, “Learning Fourier sparse set functions,” in Proc. International Conference on Artificial Intelligence and Statistics (AISTATS) , 2012, pp. 1125–1133
2012
Cited alongside, same era.
L. Baldassarre, Y.-H. Li, J. Scarlett, B. Gözcü, I. Bogunovic, and V. Cevher, “Learning-based compressive subsampling,” IEEE J. Selected Topics in Signal Processing , vol. 10, no. 4, pp. 809–822, 2016
2016
Later among the works it cites.
S. Barbarossa and M. Tsitsvero, “An introduction to hypergraph signal processing,” in Proc. International Conference on Acoustics, Speech, and Signal Processing (ICASSP) , 2016
2016
Later among the works it cites.
M. Grabisch, Set functions, games and capacities in decision making . Springer, 2016
2016
Later among the works it cites.
C. Kroemer, M. Bichler, and A. Goetzendorff, “(un) expected bidder behavior in spectrum auctions: About inconsistent bidding and its impact on efficiency in the combinatorial clock auction,” Group Decision and Negotiation , vol. 25, no. 1, pp. 31–63, 2016
2016
Later among the works it cites.
M. M. Bronstein, J. Bruna, Y. LeCun, S. A., and P. Vandergheynst, “Geometric deep learning: Going beyond euclidean data,” IEEE Signal Processing Magazine , vol. 34, pp. 18–42, 2017
2017
Later among the works it cites.
J. Zheng, Z. Jiang, and R. Chellappa, “Submodular attribute selection for visual recognition,” IEEE Trans. on Pattern Analysis and Machine Intelligence , vol. 39, no. 11, pp. 2242–2255, 2017
2017
Later among the works it cites.
K. R.Ball, C. Grant, W. R. Mundy, and T. J. Shafera, “A multivariate extension of mutual information for growing neural networks,” Neural Networks , vol. 95, pp. 29–43, 2017
2017
Later among the works it cites.
M. Coutino, S. P. Chepuri, and G. Leus, “Submodular sparse sensing for gaussian detection with correlated observations,” IEEE Trans. on Signal Processing , vol. 66, no. 15, pp. 4025–4039, 2018
2018
Later among the works it cites.
J. Shen, J. Peng, and L. Shao, “Submodular trajectories for better motion segmentation in videos,” IEEE Trans. on Image Processing , vol. 27, no. 6, pp. 2688–2700, 2018
2018
Later among the works it cites.
A. Ortega, P. Frossard, J. Kovačević, J. M. F. Moura, and P. Vandergheynst, “Graph signal processing: Overview, challenges, and applications,” Proceedings of the IEEE , vol. 106, no. 5, pp. 808–828, 2018
2018
Later among the works it cites.
G. Brero, B. Lubin, and S. Seuken, “Combinatorial auctions via machine learning-based preference elicitation,” in IJCAI , 2018, pp. 128–136
2018
Later among the works it cites.
A. Amrollahi, A. Zandieh, M. Kapralov, and A. Krause, “Efficiently learning fourier sparse set functions,” in Advances in Neural Information Processing Systems (NeurIPS) , vol. 32, 2019, pp. 15 094–15 103
2019
Later among the works it cites.
M. Püschel, “A discrete signal processing framework for meet/join lattices with applications to hypergraphs and trees,” in Proc. International Conference on Acoustics, Speech, and Signal Processing (ICASSP) , 2019, pp. 5371–5375
2019
Later among the works it cites.
G. Brero, S. Lahaie, and S. Seuken, “Fast iterative combinatorial auctions via Bayesian learning,” in Proc. of the AAAI Conference on Artificial Intelligence , vol. 33, 2019, pp. 1820–1828
2019
Later among the works it cites.
S. Barbarossa and S. Sardellitti, “Topological signal processing over simplicial complexes,” IEEE Trans. on Signal Processing , vol. 68, pp. 2992–3007, 2020
2020
Closest in time.