Probabilistic Latent Semantic Analyses (PLSA) in Bibliometric Analysis for Technology Forecasting

Due to the availability of internet-based abstract services and patent databases, bibliometric analysis has become one of key technology forecasting approaches. Recently, latent semantic analysis (LSA) has been applied to improve the accuracy in document clustering. In this paper, a new LSA method, probabilistic latent semantic analysis (PLSA) which uses probabilistic methods and algebra to search latent space in the corpus is further applied in document clustering. The results show that PLSA is more accurate than LSA and the improved iteration method proposed by authors can simplify the computing process and improve the computing efficiencyDebido a la disponibilidad de servicios abstractos de internet y bases de datos de patentes, un análisis bibliométrico se ha transformado en una aproximación clave de sondeo de tecnologías. Recientemente, el Análisis Semántico Latente (LSA) ha sido aplicado para mejorar la precisión en el clustering de documentos. En el siguiente trabajo se muestra, un nuevo método LSA, el Análisis Semántico Probabilística Latente (PLSA), que utiliza métodos probabilísticas y álgebra para buscar espacio latente en el cuerpo generado por el clustering de documentos. Los resultados demuestran que PLSA es más preciso que LSA y mejora el método de iteración propuesto por autores que simplifican los procesos de computación y mejoran la eficiencia de cómputo.Due to the availability of internet-based abstract services and patent databases, bibliometric analysis has become one of key technology forecasting approaches. Recently, latent semantic analysis (LSA) has been applied to improve the accuracy in document clustering. In this paper, a new LSA method, probabilistic latent semantic analysis (PLSA) which uses probabilistic methods and algebra to search latent space in the corpus is further applied in document clustering. The results show that PLSA is more accurate than LSA and the improved iteration method proposed by authors can simplify the computing process and improve the computing efficienc

Probabilistic Latent Semantic Analyses (PLSA) in Bibliometric Analysis for Technology Forecasting

Due to the availability of internet-based abstract services and patent databases, bibliometric analysis has become one of key technology forecasting approaches. Recently, latent semantic analysis (LSA) has been applied to improve the accuracy in document clustering. In this paper, a new LSA method, probabilistic latent semantic analysis (PLSA) which uses probabilistic methods and algebra to search latent space in the corpus is further applied in document clustering. The results show that PLSA is more accurate than LSA and the improved iteration method proposed by authors can simplify the computing process and improve the computing efficienc

A genetic algorithm based knowledge discovery system for the design of fluid dispensing processes for electronic packaging

In the semiconductor manufacturing industry, fluid dispensing is a very common process used for die-bonding and microchip encapsulation in electronics packaging. Understanding the process behaviour is important as it aids in determining appropriate settings of the process parameters for a high-yield, low cost and robust operation. In this paper, a genetic algorithm (GA) based knowledge discovery system is proposed to discover knowledge about the fluid dispensing process. This knowledge is expressed in the form of rules derived from experimental data sets. As a result, appropriate parameters can be set which will be more effective with respect to the required quality of encapsulation. Rules generated by the GA based knowledge discovery system have been validated using a computational system for process optimization of fluid dispensing. The results indicate that the rules generated are useful and promising in aiding optimization of the fluid dispensing process in terms of better optimization results and shorter computational time

Reducing overfitting in manufacturing process modeling using a backward elimination based genetic programming

Genetic programming (GP) has demonstrated as an effective approach in polynomial modeling of manufacturing processes. However, polynomial models with redundant terms generated by GP may depict overfitting, while the developed models have good accuracy on trained data sets but relatively poor accuracy on testing data sets. In the literature, approaches of avoiding overfitting in GP are handled by limiting the number of terms in polynomial models. However, those approaches cannot guarantee terms in polynomial models produced by GP are statistically significant to manufacturing processes. In this paper, a statistical method, backward elimination (BE), is proposed to incorporate with GP, in order to eliminate insignificant terms in polynomial models. The performance of the proposed GP has been evaluated by modeling three real-world manufacturing processes, epoxy dispenser for electronic packaging, solder paste dispenser for electronic manufacturing, and punch press system for leadframe downset in IC packaging. Empirical results show that insignificant terms in the polynomial models can be eliminated by the proposed GP and also the polynomial models generated by the proposed GP can achieve results with better predictions than the other commonly used existent methods, which are commonly used in GP for avoiding overfitting in polynomial modeling