Polynomial time training and network design are two major issues for the neural network community. A new algorithm has been developed that can learn in polynomial time and also design an appropriate network. The algorithm is for classification problems and uses linear programing models to design and train the network. This paper summarizes the new algorithm, proves its stability properties, and provides some computational results to demonstrate its potential.
Determining the attributes that influence the success of e-commerce is difficult due to a limited conceptual basis necessary for success measures. Keeney ( 1999 Keeney , R. L. ( 1999 ). “The value of Internet commerce to the customer.” . Management Science , Vol. 45 , No. 4 , pp. 533 – 542 . [Crossref], [Web of Science ®] [Google Scholar] ) proposed twenty-five objectives separated into two sets-fundamental objectives (the important goals of customers) and means objectives (important goals to be achieved by e-businesses)–for successful e-transactions. Based on Keeney's research, Torkzadeh and Dhillon ( 2002 Torkzadeh , G. & Dhillon , G. ( 2002 ). “Measuring factors that influence the success of Internet commerce.” . Information Systems Research , Vol. 13 , No. 2 , pp. 187 – 204 . [Crossref], [Web of Science ®] [Google Scholar] ) developed two instruments that together measure the factors that influence e-commerce success. This research uses these instruments to empirically investigate the Internet shopping behavior of college students (undergraduate and graduate). The research determines the adequacy of multivariate linear relationships between the variables of the two instruments through canonical correlation and redundancy analyses. The research formalizes and tests a series of research hypotheses on Internet shopping behaviors. The article also summarizes the research results with important conclusions and future research directions.