About
A hands on(i.e, implement production ready code) research scientist with specialization…
Articles by Jin
Activity
-
Very Exciting and Happy News. "Mastercard appoints Janet George as executive vice president of artificial intelligence" "George will lead…
Very Exciting and Happy News. "Mastercard appoints Janet George as executive vice president of artificial intelligence" "George will lead…
Liked by Jin Huang
-
👋 It’s been nearly two months since I left my job. Apart from my regular visits back to Taiwan to spend quality time with my parents, I’ve been…
👋 It’s been nearly two months since I left my job. Apart from my regular visits back to Taiwan to spend quality time with my parents, I’ve been…
Liked by Jin Huang
-
Excited to share that I'm joining OpenAI 🚀 After an incredible journey at Apple working on generative AI and foundational models (those Image…
Excited to share that I'm joining OpenAI 🚀 After an incredible journey at Apple working on generative AI and foundational models (those Image…
Liked by Jin Huang
Experience
Education
Licenses & Certifications
Publications
-
A New Simplex Sparse Learning Model to Measure Data Similarity for Clustering
IJCAI 2015, oral presentation, first author
The Laplacian matrix of a graph can be used in many areas of mathematical research and has a
physical interpretation in various theories. However, there are a few open issues in the Laplacian
graph construction: (i) Selecting the appropriate scale of analysis, (ii) Selecting the appropriate
number of neighbors, (iii) Handling multiscale data, and, (iv) Dealing with noise and outliers.
In this paper, we propose that the affinity between pairs of samples could be computed…The Laplacian matrix of a graph can be used in many areas of mathematical research and has a
physical interpretation in various theories. However, there are a few open issues in the Laplacian
graph construction: (i) Selecting the appropriate scale of analysis, (ii) Selecting the appropriate
number of neighbors, (iii) Handling multiscale data, and, (iv) Dealing with noise and outliers.
In this paper, we propose that the affinity between pairs of samples could be computed using
sparse representation with proper constraints. This parameter free setting automatically produces the
Laplacian graph, leads to significant reduction in computation cost and robustness to the outliers and
noise. We further provide an efficient algorithm to solve the difficult optimization problem based on
improvement of existing algorithms.Other authors -
Approximate Algorithms for Computing Distance Histograms with Accuracy Guarantees
IEEE Transaction on Knowledge and Data Engineering
-
Robust Discrete Matrix Completion
AAAI 2013 main track, first author
Most existing matrix completion methods seek the matrix global structure in the real number domain and produce predictions that are inappropriate for applications retaining discrete structure, where an additional step is required to post-process prediction results with either heuristic threshold parameters or complicated mappings.Such an ad-hoc process is inefficient and impractical. In this paper, we propose a novel robust discrete matrix completion algorithm that produces the prediction from…
Most existing matrix completion methods seek the matrix global structure in the real number domain and produce predictions that are inappropriate for applications retaining discrete structure, where an additional step is required to post-process prediction results with either heuristic threshold parameters or complicated mappings.Such an ad-hoc process is inefficient and impractical. In this paper, we propose a novel robust discrete matrix completion algorithm that produces the prediction from the collection of user specified discrete values by introducing a new discrete constraint to the matrix completion model. Our method achieves a high prediction
accuracy, very close to the most optimal value of competitive methods with threshold values tuning. We solve the difficult integer programming problem via incorporating augmented Lagrangian method in an elegant way, which greatly accelerates the converge process of our method and provides the asymptotic convergence in theory. The proposed discrete matrix completion
model is applied to solve three real-world applications, and all empirical results demonstrate the effectiveness of our method.Other authors -
-
Spectral Rotation vs K-means in Spectral Clustering
AAAI 2013 main track, first author
Conventional spectral clustering methods often resort to other clustering methods, such as K-Means, to get the final cluster. The potential flaw of such common practice is that the obtained relaxed continuous spectral solution could severely deviate from the true discrete solution. In this paper, we propose to impose an additional orthonormal constraint to better approximate the optimal continuous solution to the graph cut objective functions. Such a method, called spectral rotation in…
Conventional spectral clustering methods often resort to other clustering methods, such as K-Means, to get the final cluster. The potential flaw of such common practice is that the obtained relaxed continuous spectral solution could severely deviate from the true discrete solution. In this paper, we propose to impose an additional orthonormal constraint to better approximate the optimal continuous solution to the graph cut objective functions. Such a method, called spectral rotation in literature, optimizes the spectral clustering objective functions better than K-Means, and improves the clustering accuracy. We would provide efficient algorithm to solve the new problem rigorously, which is not significantly more costly than K-Means. We also establish the connection between our method and K-Means to provide theoretical motivation of our method. Experimental results show that our algorithm consistently reaches better cut and meanwhile outperforms in clustering metrics than classic spectral clustering methods.
Other authors -
-
Supervised and Projected Sparse Coding for Image Classification
AAAI 2013 main track, first author
Classic sparse representation for classification (SRC) method fails to incorporate the label information of training images, and meanwhile has a poor scalability due to the expensive computation for L1 norm. In this paper, we propose a novel subspace sparse coding method with utilizing label information to effectively classify the images in the subspace. Our new approach
unifies the tasks of dimension reduction and supervised sparse vector learning, by simultaneously preserving the data…Classic sparse representation for classification (SRC) method fails to incorporate the label information of training images, and meanwhile has a poor scalability due to the expensive computation for L1 norm. In this paper, we propose a novel subspace sparse coding method with utilizing label information to effectively classify the images in the subspace. Our new approach
unifies the tasks of dimension reduction and supervised sparse vector learning, by simultaneously preserving the data sparse structure and meanwhile seeking the optimal projection direction in the training stage, therefore accelerates the classification process in the test stage. Our method achieves both flat and structured sparsity for the vector representations, therefore making
our framework more discriminative during the subspace learning and subsequent classification.Other authors -
-
A New Sparse Simplex Model for Brain Anatomical and Genetic Network Analysis
MICCAI 2013 LNCS-Springer
we propose a novel sparse simplex model to accurately construct the brain anatomical and genetic networks, which are important to reveal the brain spatial expression patterns.
Other authors -
-
Robust Manifold Non-Negative Matrix Factorization
ACM Transaction on Knowledge and Data Discovery, first author
A novel way to conduct data clustering via Non-Negative Matrix Factorization
Other authors -
-
Social Trust Prediction Using Heterogeneous Networks
ACM Transaction on Knowledge and Data Discovery, first author
Predict users' relationships in social network via aggregating multiple sources of information
Other authors -
-
Social Trust Prediction Using Rank-k Matrix Recovery
IJCAI 2013, first author, Oral Presentation
In this paper, we propose a new method to predict the pairwise relationship status between social network users. Conventional social network graphs (such as facebook), has large amount of missing values. Our method assumes the trust votes for individual users are determined by a few latent factors such as similar background, hobbies etc. Empirical experiments demonstrate the effectiveness of our method.
Other authors -
-
Trust Prediction via Aggregating Heterogeneous Social Networks
CIKM 2012, first author
Other authors -
Projects
-
Esnet Large Volume Network Traffic Prediction
Using time series technique to analyze the correlation and predict the future trend
Other creators -
-
NIH grant proposal evaluation semantic analysis
This project is to develop a software to automatically analyze the reviews' evaluation for NIH grant proposal. I am the one who develop NLP learning rules and Python package developer
-
Social Network Trust Prediction
- Present
Relationship Status Prediction between users in large scale social network, identify who's friend and who's enemy. Design a collaborative filtering work that incorporates users' recommendation system into the trust prediction, which significantly improves the prediction accuracies for both graph
Improve the social graph prediction accuracy 4% than conventional methods
Provide a new prospective to improve recommendation system -
Making Databases Green: An Energy-Aware DBMS Approach
- Present
Design a low energy consuming computing database platform, saves 25% energy
Incorporate MapReduce, Hadoop framrwork to big data analysis in energy saving mode -
Efficient Data Processing in Molecular Dynamics Simulation
- Present
Design an efficient algorithm O(nlgn) instead of O(n^2) to handle billions of pair-wise distance
Provide the theoretic accuracy guarantee proof for our approximate algorithm
Languages
-
English
Full professional proficiency
-
Chinese
Native or bilingual proficiency
More activity by Jin
-
Rui Zhang, assistant professor of computer science, earned a National Science Foundation (NSF) Early Career Development (CAREER) Award for a project…
Rui Zhang, assistant professor of computer science, earned a National Science Foundation (NSF) Early Career Development (CAREER) Award for a project…
Liked by Jin Huang
-
Happy Father's Day to the best mom anyone could ask for ! My dad passed away when I was 5 years old and my mom raised me and my sisters on her own…
Happy Father's Day to the best mom anyone could ask for ! My dad passed away when I was 5 years old and my mom raised me and my sisters on her own…
Liked by Jin Huang
-
💡 Another great event, this week's Fortinet session focused on "Women leading the charge: inspiring community in cybersecurity". It was great to…
💡 Another great event, this week's Fortinet session focused on "Women leading the charge: inspiring community in cybersecurity". It was great to…
Liked by Jin Huang
-
I am deeply honored and humbled to receive the ICDE 10-Year Influential Paper Award. I wish I could have been there in person! Graph partitioning…
I am deeply honored and humbled to receive the ICDE 10-Year Influential Paper Award. I wish I could have been there in person! Graph partitioning…
Liked by Jin Huang
-
My first project after joining Apple. We introduce principles for deploying efficient attention-based vision transformers to the Apple Neural Engine…
My first project after joining Apple. We introduce principles for deploying efficient attention-based vision transformers to the Apple Neural Engine…
Liked by Jin Huang
-
Ready to present our #EMNLP2023 paper "Hallucination Mitigation in Natural Language Generation from Large-Scale Open-Domain Knowledge Graphs"
Ready to present our #EMNLP2023 paper "Hallucination Mitigation in Natural Language Generation from Large-Scale Open-Domain Knowledge Graphs"
Liked by Jin Huang
-
Today I am sharing how Gemini Ultra Stacks up. This is according to Google, interesting score on reasoning for everyday tasks for GPT4 and for…
Today I am sharing how Gemini Ultra Stacks up. This is according to Google, interesting score on reasoning for everyday tasks for GPT4 and for…
Liked by Jin Huang
-
I have spent considerable years of my career life being an AI practitioner in the life sciences industry Today I am sharing some major turning points…
I have spent considerable years of my career life being an AI practitioner in the life sciences industry Today I am sharing some major turning points…
Liked by Jin Huang
Other similar profiles
Explore collaborative articles
We’re unlocking community knowledge in a new way. Experts add insights directly into each article, started with the help of AI.
Explore MoreOthers named Jin Huang in United States
200 others named Jin Huang in United States are on LinkedIn
See others named Jin Huang