Sorry, you need to enable JavaScript to visit this website.

Emerging: Big Data

Submodular Maximization with Multi-Knapsack Constraints and its Applications in Scientific Literature Recommendations


Submodular maximization problems belong to the family of combinatorial optimization problems and enjoy wide applications. In this paper, we focus on the problem of maximizing a monotone submodular function subject to a d-knapsack constraint, for which we propose a streaming algorithm that
achieves a (1/1+2d − ε) -approximation of the optimal value,

Paper Details

Authors:
Qilian Yu, Easton Li Xu, Shuguang Cui
Submitted On:
2 December 2016 - 10:41pm
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

Lecture Slides

(138 downloads)

Keywords

Subscribe

[1] Qilian Yu, Easton Li Xu, Shuguang Cui, "Submodular Maximization with Multi-Knapsack Constraints and its Applications in Scientific Literature Recommendations", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/1336. Accessed: Dec. 16, 2017.
@article{1336-16,
url = {http://sigport.org/1336},
author = {Qilian Yu; Easton Li Xu; Shuguang Cui },
publisher = {IEEE SigPort},
title = {Submodular Maximization with Multi-Knapsack Constraints and its Applications in Scientific Literature Recommendations},
year = {2016} }
TY - EJOUR
T1 - Submodular Maximization with Multi-Knapsack Constraints and its Applications in Scientific Literature Recommendations
AU - Qilian Yu; Easton Li Xu; Shuguang Cui
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/1336
ER -
Qilian Yu, Easton Li Xu, Shuguang Cui. (2016). Submodular Maximization with Multi-Knapsack Constraints and its Applications in Scientific Literature Recommendations. IEEE SigPort. http://sigport.org/1336
Qilian Yu, Easton Li Xu, Shuguang Cui, 2016. Submodular Maximization with Multi-Knapsack Constraints and its Applications in Scientific Literature Recommendations. Available at: http://sigport.org/1336.
Qilian Yu, Easton Li Xu, Shuguang Cui. (2016). "Submodular Maximization with Multi-Knapsack Constraints and its Applications in Scientific Literature Recommendations." Web.
1. Qilian Yu, Easton Li Xu, Shuguang Cui. Submodular Maximization with Multi-Knapsack Constraints and its Applications in Scientific Literature Recommendations [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/1336

I-LoViT: Indoor Localization by Vibration Tracking


Signal processing techniques can create new applications for the data captured by existing sensor systems. Decades old sensor technology for monitoring the structural health of a building can serve a new role as a novel source of indoor localization data. Specifically, when a person's footstep-generated floor vibrations can be detected and located then it is possible to locate persons moving within a building. This emergent cyber-physical system holds the potential for an ambient localization service.

Paper Details

Authors:
Submitted On:
27 November 2016 - 11:17am
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

I-LoViT briefing slides

(126 downloads)

Keywords

Additional Categories

Subscribe

[1] , "I-LoViT: Indoor Localization by Vibration Tracking", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/1313. Accessed: Dec. 16, 2017.
@article{1313-16,
url = {http://sigport.org/1313},
author = { },
publisher = {IEEE SigPort},
title = {I-LoViT: Indoor Localization by Vibration Tracking},
year = {2016} }
TY - EJOUR
T1 - I-LoViT: Indoor Localization by Vibration Tracking
AU -
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/1313
ER -
. (2016). I-LoViT: Indoor Localization by Vibration Tracking. IEEE SigPort. http://sigport.org/1313
, 2016. I-LoViT: Indoor Localization by Vibration Tracking. Available at: http://sigport.org/1313.
. (2016). "I-LoViT: Indoor Localization by Vibration Tracking." Web.
1. . I-LoViT: Indoor Localization by Vibration Tracking [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/1313

Named Entity Recognition on Indonesian Microblog Messages


This paper describes a model to address the task of named-entity recognition on Indonesian microblog messages due to its usefulness for higher-level tasks or text mining applications on Indonesian microblogs. We view our task as a sequence labeling problem using machine learning approach. We also propose various word-level and orthographic features, including the ones that are specific to the Indonesian language. Finally, in our experiment, we compared our model with a baseline model previously proposed for Indonesian formal documents, instead of microblog messages.

Paper Details

Authors:
Natanael Taufik, Alfan F. Wicaksono, Mirna Adriani
Submitted On:
22 November 2016 - 7:42am
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

IALP2016 - Named Entity Recognition on Indonesian Microblog Messages.pdf

(137 downloads)

Keywords

Additional Categories

Subscribe

[1] Natanael Taufik, Alfan F. Wicaksono, Mirna Adriani, "Named Entity Recognition on Indonesian Microblog Messages", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/1293. Accessed: Dec. 16, 2017.
@article{1293-16,
url = {http://sigport.org/1293},
author = {Natanael Taufik; Alfan F. Wicaksono; Mirna Adriani },
publisher = {IEEE SigPort},
title = {Named Entity Recognition on Indonesian Microblog Messages},
year = {2016} }
TY - EJOUR
T1 - Named Entity Recognition on Indonesian Microblog Messages
AU - Natanael Taufik; Alfan F. Wicaksono; Mirna Adriani
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/1293
ER -
Natanael Taufik, Alfan F. Wicaksono, Mirna Adriani. (2016). Named Entity Recognition on Indonesian Microblog Messages. IEEE SigPort. http://sigport.org/1293
Natanael Taufik, Alfan F. Wicaksono, Mirna Adriani, 2016. Named Entity Recognition on Indonesian Microblog Messages. Available at: http://sigport.org/1293.
Natanael Taufik, Alfan F. Wicaksono, Mirna Adriani. (2016). "Named Entity Recognition on Indonesian Microblog Messages." Web.
1. Natanael Taufik, Alfan F. Wicaksono, Mirna Adriani. Named Entity Recognition on Indonesian Microblog Messages [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/1293

Valence-Arousal Ratings Prediction with Co-occurrence Word-embedding


Sentiment analysis draws increasing attention of researchers in wide-ranging fields. Compared with the commonly-used categorical

Paper Details

Authors:
Jing Xu, Xu Yang, Bin Xu
Submitted On:
18 November 2016 - 1:55am
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

Valence-Arousal Ratings Prediction with Co-occurrence Word-embedding.pdf

(108 downloads)

Keywords

Subscribe

[1] Jing Xu, Xu Yang, Bin Xu, "Valence-Arousal Ratings Prediction with Co-occurrence Word-embedding", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/1270. Accessed: Dec. 16, 2017.
@article{1270-16,
url = {http://sigport.org/1270},
author = {Jing Xu; Xu Yang; Bin Xu },
publisher = {IEEE SigPort},
title = {Valence-Arousal Ratings Prediction with Co-occurrence Word-embedding},
year = {2016} }
TY - EJOUR
T1 - Valence-Arousal Ratings Prediction with Co-occurrence Word-embedding
AU - Jing Xu; Xu Yang; Bin Xu
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/1270
ER -
Jing Xu, Xu Yang, Bin Xu. (2016). Valence-Arousal Ratings Prediction with Co-occurrence Word-embedding. IEEE SigPort. http://sigport.org/1270
Jing Xu, Xu Yang, Bin Xu, 2016. Valence-Arousal Ratings Prediction with Co-occurrence Word-embedding. Available at: http://sigport.org/1270.
Jing Xu, Xu Yang, Bin Xu. (2016). "Valence-Arousal Ratings Prediction with Co-occurrence Word-embedding." Web.
1. Jing Xu, Xu Yang, Bin Xu. Valence-Arousal Ratings Prediction with Co-occurrence Word-embedding [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/1270

Robust Estimation of Self-Exciting Point Process Models with Application to Neuronal Modeling


We consider the problem of estimating discrete self- exciting point process models from limited binary observations, where the history of the process serves as the covariate. We analyze the performance of two classes of estimators: l1-regularized maximum likelihood and greedy estimation for a discrete version of the Hawkes process and characterize the sampling tradeoffs required for stable recovery in the non-asymptotic regime. Our results extend those of compressed sensing for linear and generalized linear models with i.i.d.

Paper Details

Authors:
Abbas Kazemipour, Min Wu and Behtash Babadi
Submitted On:
12 December 2016 - 9:35am
Short Link:
Type:
Document Year:
Cite

Document Files

Robust_SEPP_TSP.pdf

(145 downloads)

Keywords

Subscribe

[1] Abbas Kazemipour, Min Wu and Behtash Babadi, "Robust Estimation of Self-Exciting Point Process Models with Application to Neuronal Modeling", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/1261. Accessed: Dec. 16, 2017.
@article{1261-16,
url = {http://sigport.org/1261},
author = {Abbas Kazemipour; Min Wu and Behtash Babadi },
publisher = {IEEE SigPort},
title = {Robust Estimation of Self-Exciting Point Process Models with Application to Neuronal Modeling},
year = {2016} }
TY - EJOUR
T1 - Robust Estimation of Self-Exciting Point Process Models with Application to Neuronal Modeling
AU - Abbas Kazemipour; Min Wu and Behtash Babadi
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/1261
ER -
Abbas Kazemipour, Min Wu and Behtash Babadi. (2016). Robust Estimation of Self-Exciting Point Process Models with Application to Neuronal Modeling. IEEE SigPort. http://sigport.org/1261
Abbas Kazemipour, Min Wu and Behtash Babadi, 2016. Robust Estimation of Self-Exciting Point Process Models with Application to Neuronal Modeling. Available at: http://sigport.org/1261.
Abbas Kazemipour, Min Wu and Behtash Babadi. (2016). "Robust Estimation of Self-Exciting Point Process Models with Application to Neuronal Modeling." Web.
1. Abbas Kazemipour, Min Wu and Behtash Babadi. Robust Estimation of Self-Exciting Point Process Models with Application to Neuronal Modeling [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/1261

Overlapping Clustering of Network Data Using Cut Metrics


We present a novel method to hierarchically cluster networked data allowing nodes to simultaneously belong to multiple clusters. Given a network, our method outputs a cut metric on the underlying node set, which can be related to data coverings at different resolutions. The cut metric is obtained by averaging a set of ultrametrics, which are themselves the output of (non-overlapping) hierarchically clustering noisy versions of the original network of interest. The resulting algorithm is illustrated in synthetic networks and is used to classify handwritten digits from the MNIST database.

Paper Details

Authors:
Fernando Gama, Santiago Segarra, Alejandro Ribeiro
Submitted On:
24 March 2016 - 4:45am
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

cut-metrics-icassp16-presentation.pdf

(236 downloads)

Keywords

Additional Categories

Subscribe

[1] Fernando Gama, Santiago Segarra, Alejandro Ribeiro, "Overlapping Clustering of Network Data Using Cut Metrics", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/1020. Accessed: Dec. 16, 2017.
@article{1020-16,
url = {http://sigport.org/1020},
author = {Fernando Gama; Santiago Segarra; Alejandro Ribeiro },
publisher = {IEEE SigPort},
title = {Overlapping Clustering of Network Data Using Cut Metrics},
year = {2016} }
TY - EJOUR
T1 - Overlapping Clustering of Network Data Using Cut Metrics
AU - Fernando Gama; Santiago Segarra; Alejandro Ribeiro
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/1020
ER -
Fernando Gama, Santiago Segarra, Alejandro Ribeiro. (2016). Overlapping Clustering of Network Data Using Cut Metrics. IEEE SigPort. http://sigport.org/1020
Fernando Gama, Santiago Segarra, Alejandro Ribeiro, 2016. Overlapping Clustering of Network Data Using Cut Metrics. Available at: http://sigport.org/1020.
Fernando Gama, Santiago Segarra, Alejandro Ribeiro. (2016). "Overlapping Clustering of Network Data Using Cut Metrics." Web.
1. Fernando Gama, Santiago Segarra, Alejandro Ribeiro. Overlapping Clustering of Network Data Using Cut Metrics [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/1020

ONLINE INCREMENTAL HIGHER-ORDER PARTIAL LEAST SQUARES REGRESSION FOR FAST RECONSTRUCTION OF MOTION TRAJECTORIES FROM TENSOR STREAMS

Paper Details

Authors:
Submitted On:
23 March 2016 - 9:10pm
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

icassp16_poster_ming_hou.pdf

(221 downloads)

Keywords

Subscribe

[1] , "ONLINE INCREMENTAL HIGHER-ORDER PARTIAL LEAST SQUARES REGRESSION FOR FAST RECONSTRUCTION OF MOTION TRAJECTORIES FROM TENSOR STREAMS", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/1015. Accessed: Dec. 16, 2017.
@article{1015-16,
url = {http://sigport.org/1015},
author = { },
publisher = {IEEE SigPort},
title = {ONLINE INCREMENTAL HIGHER-ORDER PARTIAL LEAST SQUARES REGRESSION FOR FAST RECONSTRUCTION OF MOTION TRAJECTORIES FROM TENSOR STREAMS},
year = {2016} }
TY - EJOUR
T1 - ONLINE INCREMENTAL HIGHER-ORDER PARTIAL LEAST SQUARES REGRESSION FOR FAST RECONSTRUCTION OF MOTION TRAJECTORIES FROM TENSOR STREAMS
AU -
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/1015
ER -
. (2016). ONLINE INCREMENTAL HIGHER-ORDER PARTIAL LEAST SQUARES REGRESSION FOR FAST RECONSTRUCTION OF MOTION TRAJECTORIES FROM TENSOR STREAMS. IEEE SigPort. http://sigport.org/1015
, 2016. ONLINE INCREMENTAL HIGHER-ORDER PARTIAL LEAST SQUARES REGRESSION FOR FAST RECONSTRUCTION OF MOTION TRAJECTORIES FROM TENSOR STREAMS. Available at: http://sigport.org/1015.
. (2016). "ONLINE INCREMENTAL HIGHER-ORDER PARTIAL LEAST SQUARES REGRESSION FOR FAST RECONSTRUCTION OF MOTION TRAJECTORIES FROM TENSOR STREAMS." Web.
1. . ONLINE INCREMENTAL HIGHER-ORDER PARTIAL LEAST SQUARES REGRESSION FOR FAST RECONSTRUCTION OF MOTION TRAJECTORIES FROM TENSOR STREAMS [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/1015

Active Learning on Weighted Graphs Using Adaptive and Non-adaptive Approaches

Paper Details

Authors:
Eyal En Gad, Akshay Gadde, Salman Avestimehr, Antonio Ortega
Submitted On:
21 March 2016 - 7:53pm
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

ppt_v2.pdf

(284 downloads)

Keywords

Additional Categories

Subscribe

[1] Eyal En Gad, Akshay Gadde, Salman Avestimehr, Antonio Ortega, "Active Learning on Weighted Graphs Using Adaptive and Non-adaptive Approaches", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/941. Accessed: Dec. 16, 2017.
@article{941-16,
url = {http://sigport.org/941},
author = {Eyal En Gad; Akshay Gadde; Salman Avestimehr; Antonio Ortega },
publisher = {IEEE SigPort},
title = {Active Learning on Weighted Graphs Using Adaptive and Non-adaptive Approaches},
year = {2016} }
TY - EJOUR
T1 - Active Learning on Weighted Graphs Using Adaptive and Non-adaptive Approaches
AU - Eyal En Gad; Akshay Gadde; Salman Avestimehr; Antonio Ortega
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/941
ER -
Eyal En Gad, Akshay Gadde, Salman Avestimehr, Antonio Ortega. (2016). Active Learning on Weighted Graphs Using Adaptive and Non-adaptive Approaches. IEEE SigPort. http://sigport.org/941
Eyal En Gad, Akshay Gadde, Salman Avestimehr, Antonio Ortega, 2016. Active Learning on Weighted Graphs Using Adaptive and Non-adaptive Approaches. Available at: http://sigport.org/941.
Eyal En Gad, Akshay Gadde, Salman Avestimehr, Antonio Ortega. (2016). "Active Learning on Weighted Graphs Using Adaptive and Non-adaptive Approaches." Web.
1. Eyal En Gad, Akshay Gadde, Salman Avestimehr, Antonio Ortega. Active Learning on Weighted Graphs Using Adaptive and Non-adaptive Approaches [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/941

BIPARTITE SUBGRAPH DECOMPOSITION FOR CRITICALLY SAMPLED WAVELET FILTERBANKS ON ARBITARY GRAPHS


china temperature graph

The observation of frequency folding in graph spectrum during down-sampling for signals on bipartite graphs—analogous to the same phenomenon in Fourier domain for regularly sampled signals—has led to the development of critically sampled wavelet filterbanks such as GraphBior. However, typical graph-signals live on general graphs that are not necessarily bipartite.

Paper Details

Authors:
Jin Zeng, Gene Cheung, Antonio Ortega
Submitted On:
20 March 2016 - 10:58am
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

ICASSP16_Jin.pdf

(250 downloads)

Keywords

Subscribe

[1] Jin Zeng, Gene Cheung, Antonio Ortega, "BIPARTITE SUBGRAPH DECOMPOSITION FOR CRITICALLY SAMPLED WAVELET FILTERBANKS ON ARBITARY GRAPHS", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/878. Accessed: Dec. 16, 2017.
@article{878-16,
url = {http://sigport.org/878},
author = {Jin Zeng; Gene Cheung; Antonio Ortega },
publisher = {IEEE SigPort},
title = {BIPARTITE SUBGRAPH DECOMPOSITION FOR CRITICALLY SAMPLED WAVELET FILTERBANKS ON ARBITARY GRAPHS},
year = {2016} }
TY - EJOUR
T1 - BIPARTITE SUBGRAPH DECOMPOSITION FOR CRITICALLY SAMPLED WAVELET FILTERBANKS ON ARBITARY GRAPHS
AU - Jin Zeng; Gene Cheung; Antonio Ortega
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/878
ER -
Jin Zeng, Gene Cheung, Antonio Ortega. (2016). BIPARTITE SUBGRAPH DECOMPOSITION FOR CRITICALLY SAMPLED WAVELET FILTERBANKS ON ARBITARY GRAPHS. IEEE SigPort. http://sigport.org/878
Jin Zeng, Gene Cheung, Antonio Ortega, 2016. BIPARTITE SUBGRAPH DECOMPOSITION FOR CRITICALLY SAMPLED WAVELET FILTERBANKS ON ARBITARY GRAPHS. Available at: http://sigport.org/878.
Jin Zeng, Gene Cheung, Antonio Ortega. (2016). "BIPARTITE SUBGRAPH DECOMPOSITION FOR CRITICALLY SAMPLED WAVELET FILTERBANKS ON ARBITARY GRAPHS." Web.
1. Jin Zeng, Gene Cheung, Antonio Ortega. BIPARTITE SUBGRAPH DECOMPOSITION FOR CRITICALLY SAMPLED WAVELET FILTERBANKS ON ARBITARY GRAPHS [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/878

Distributed Estimation via Paid Crowd Work


Consider a distributed estimation problem to be carried out by paid crowdworkers, where results are to be returned quickly and accurately. Estimation accuracy is a function of the number of workers completing the job and of the quality of the workers, both of which may be influenced by the payment offered. With limited budget, payment allocation should consider both effects to obtain best results. Since people are not deterministic, payment offers will lead to a random number of variable-quality workers, as governed by choice models.

poster.pdf

PDF icon poster.pdf (386 downloads)

Paper Details

Authors:
Song Jianhan, Vei Wang Isaac Phua, and Lav R. Varshney
Submitted On:
19 March 2016 - 8:40pm
Short Link:
Type:
Event:
Presenter's Name:
Document Year:
Cite

Document Files

poster.pdf

(386 downloads)

Keywords

Subscribe

[1] Song Jianhan, Vei Wang Isaac Phua, and Lav R. Varshney, "Distributed Estimation via Paid Crowd Work", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/840. Accessed: Dec. 16, 2017.
@article{840-16,
url = {http://sigport.org/840},
author = {Song Jianhan; Vei Wang Isaac Phua; and Lav R. Varshney },
publisher = {IEEE SigPort},
title = {Distributed Estimation via Paid Crowd Work},
year = {2016} }
TY - EJOUR
T1 - Distributed Estimation via Paid Crowd Work
AU - Song Jianhan; Vei Wang Isaac Phua; and Lav R. Varshney
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/840
ER -
Song Jianhan, Vei Wang Isaac Phua, and Lav R. Varshney. (2016). Distributed Estimation via Paid Crowd Work. IEEE SigPort. http://sigport.org/840
Song Jianhan, Vei Wang Isaac Phua, and Lav R. Varshney, 2016. Distributed Estimation via Paid Crowd Work. Available at: http://sigport.org/840.
Song Jianhan, Vei Wang Isaac Phua, and Lav R. Varshney. (2016). "Distributed Estimation via Paid Crowd Work." Web.
1. Song Jianhan, Vei Wang Isaac Phua, and Lav R. Varshney. Distributed Estimation via Paid Crowd Work [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/840

Pages