USRE42481E1  Semiconductor yield management system and method  Google Patents
Semiconductor yield management system and method Download PDFInfo
 Publication number
 USRE42481E1 USRE42481E1 US10972115 US97211504A USRE42481E US RE42481 E1 USRE42481 E1 US RE42481E1 US 10972115 US10972115 US 10972115 US 97211504 A US97211504 A US 97211504A US RE42481 E USRE42481 E US RE42481E
 Authority
 US
 Grant status
 Grant
 Patent type
 Prior art keywords
 node
 variables
 prediction
 split
 pre
 Prior art date
 Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
 Active
Links
Images
Classifications

 H—ELECTRICITY
 H01—BASIC ELECTRIC ELEMENTS
 H01L—SEMICONDUCTOR DEVICES; ELECTRIC SOLID STATE DEVICES NOT OTHERWISE PROVIDED FOR
 H01L22/00—Testing or measuring during manufacture or treatment; Reliability measurements, i.e. testing of parts without further processing to modify the parts as such; Structural arrangements therefor
 H01L22/20—Sequence of activities consisting of a plurality of measurements, corrections, marking or sorting steps
Abstract
Description
This invention relates generally to a system and method for managing a semiconductor process and in particular to a system and method for managing yield in a semiconductor process.
The semiconductor industry is continually pushing toward smaller and smaller geometries of the semiconductor devices being produced since smaller devices generate less heat and operate at a higher speed than larger devices. Currently, a single chip may contain over one billion patterns. The semiconductor manufacturing process is extremely complicated since it involves hundreds of processing steps. A mistake or small error at any of the process steps or tool specifications may cause lower yield in the final semiconductor product, wherein yield may be defined as the number of functional devices produced by the process as compared to the theoretical number of devices that could be produced assuming no bad devices. Improving yield is a critical problem in the semiconductor industry and has a direct economic impact to the semiconductor industry. In particular, a higher yield translates into more devices that may be sold by the manufacturer.
Semiconductor manufacturing companies have been collecting data for a long time about various process parameters in an attempt to improve the yield of the semiconductor process. Today, an explosive growth of database technology has contributed to the yield analysis that each company follows. In particular, the database technology has far outpaced the yield management ability when using conventional statistical methods to interpret and relate yield to major yield factors. This has created a need for a new generation of tools and techniques for automated and intelligent database analysis for yield management.
Current conventional yield management systems have a number of limitations and disadvantages which make them less desirable to the semiconductor industry. For example, the conventional systems may require some manual processing which slows the analysis and makes it susceptible to human error. In addition, these conventional systems may not handle both continuous and categorical yield management variables. Some conventional systems cannot handle missing data elements and do not permit rapid searching through hundreds of yield parameters to identify key yield factors. Some conventional systems output data that is difficult to understand or interpret even by knowledgeable semiconductor yield management people. In addition, the conventional systems typically process each yield parameter separately, which is time consuming and cumbersome and cannot identify more than one parameter at a time.
Thus, it is desirable to provide a yield management system and method which solves the above limitations and disadvantages of the conventional systems and it is to this end that the present invention is directed.
The yield management system and method in accordance with the invention may provide many advantages over conventional methods and systems which make the yield management system and method more useful to semiconductor device manufacturers. In particular, the system may be fully automated and easy to use so that no extra training is necessary to make use of the yield management system. In addition, the system handles both continuous (e.g., temperature) and categorical (e.g., Lot 1, Lot 2, etc.) variables. The system also automatically handles missing data during a preprocessing step. The system can rapidly search through hundreds of yield parameters and generate an output indicating the one or more key yield factors/parameters. The system generates an output (a decision tree) that is easy to interpret and understand. The system is also very flexible in that it permits prior yield parameter knowledge (from users) to be easily incorporated into the building of the model in accordance with the invention. Unlike conventional systems, if there is more than one yield factor/parameter affecting the yield of the process, the system can identify all of the parameters/factors simultaneously so that the multiple factors are identified during a single pass through the yield data.
In accordance with a preferred embodiment of the invention, the yield management method may receive a yield data set. When a data set comes in, it first goes through a data preprocessing step in which the validity of the data in the data set is checked and cases or parameters with missing data are eliminated. Using the cleaned up data set, a Yield Mine model is built during a model building step. Once the model is generated automatically by the yield management system, the model may be modified by one or more users based on their experience or prior knowledge of the data set. Once the model has been modified, the data set may be processed using various statistical analysis tools to help the user better understand the relationship between the response and predict variables.
The invention is particularly applicable to a computerimplemented softwarebased yield management system and it is in this context that the invention will be described. It will be appreciated, however, that the system and method in accordance with the invention has greater utility since it may be implemented in hardware or may incorporate other modules or functionality not described herein.
In accordance with the invention, the yield management system may also be implemented using hardware and may be implemented on different types of computer systems, such as client/server systems, web servers, mainframe computers, workstations and the like. Now, more details of the implementation of the yield management system in software will be described.
In more detail, the data may be input to a data preprocessor 32 that may validate the data and remove any missing data records. The output from the data preprocessor may be fed into a model builder 34 so that a model of the data set may be automatically generated by the system. Once the system has generated a model, the user may enter model modifications into the model builder to modify the model based on, for example, past experience with the particular data set. Once the user modifications have been incorporated into the model, a final model is output and made available to a statistical tool library 36. The library may contain one or more different statistical tools that may be used to analyze the final model. The output of the system may be, for example, a listing of one or more factors/parameters that contributed to the yield of the devices that generated the data set being analyzed. As described above, the system is able to simultaneously identify multiple yield factors. Now, a yield management method in accordance with the invention will be described.
The data preprocessing step 42 helps to clean up the incoming data set so that the later analysis may be more fruitful. The yield management system in accordance with the invention can handle data sets with complicated data structures. A yield data set typically has hundreds of different variables. These variables may include both a response variable, Y, and predictor variables, X_{1}, X_{2}, . . . , X_{m}, that may be of a numerical type or a categorical type. A variable is a numerical type variable if its values are real numbers, such as different temperatures at different time times during the process. A variable is a categorical type variable if its values are of a set of finite elements not necessarily having any natural ordering. For example, a categorical variable could takes take values in a set of {MachineA, MachineB, MachineC} or values of (Lot1, Lot2 or Lot3).
It is very common for a yield data set to have missing values. The data preprocessing step removes the cases or variables having missing values. In particular, the preprocessing first may remove all predictor variables that are “bad”. By “bad”, it is understood that either a variable has too much missing data, ≧MS, or, for a categorical variable, if the variable has too many distinct classes, ≧DC. In accordance with the invention, both MS and DC are user defined thresholds so that the user may set these values and control the preprocessing of the data. In a preferred embodiment, the default value values are MS=0.05×N, DC=32, where N is the total number of cases in the data set.
Once the “bad” predictor variables are removed, then, for the remaining data set, data preprocessing may remove all cases with missing data. If one imagines that the original data set is a matrix with each column representing a single variable, then data preprocessing first removes all “bad” columns (variables) and then removes “bad rows” (missing data) in the remaining data set with the “good” columns.
The yield management system uses a decision treebased method. In particular, the method partitions the data set, D, into subregions. The tree structure may be a hierarchical way to describe a partition of D. It is constructed by successively splitting nodes (as described below), starting with the root node (D), until some stopping criteria are met and the node is declared a terminal node. For each terminal node, a value or a class is assigned to all the cases within the node. Now, the node splitting method and example of the decision tree will be described in more detail.
In this example, out of all 774 predictor variables, the Yield Mine system using the decision tree prediction, identifies one or more variables as key yield factors. In this example, the key yield factor variables are PWELLASH, FINISFI, TI_TIN_RTP_, and VTPSP_. In this example, PWELLASH and FINISFI are time variables associated with the process variables PWELLASH_and FINISFI_and TI_{13 }TIN_RTP_ TI_{—}TIN_{—}RTP_and VTPSP_are process variables. Note that, for each terminal node 102 in the decision tree, the value of the response variable at that terminal node is shown so that the user can view the tree and easily determine which terminal node (and thus which predictor variables) result in the best value of the response variable.
In the tree structure model in accordance with the invention, if a tree node is not terminal, it has a splitting criterion for the construction of its subnodes as will be described in more detail below with reference to
To find the proper stopping criteria for tree construction is a difficult problem. To deal with the problem we first overgrow the tree and then apply cross validation techniques to prune the tree. Pruning the tree is described in detail in the following sections. To grow an over sized tree, the method may keep splitting nodes in the tree until all cases in the node having the same response value, or the number of cases in the node is less than a user defined threshold, n_{0}. The default in our algorithm is n_{0}=max{5, floor(0.02×N)} where N is the total number of cases in D, and the function floor(x) gives the biggest integer that is less than or equal to x. Now, the construction of the decision tree and the method for splitting tree nodes in accordance with the invention will be described.
If Φ_{j}>V, then in step 126, the node, T, is split into one or more subnodes, T_{1}, T_{2}, . . . , T_{m}, based on the variable j. In step 128, for each subnode, T_{k }where k=1, . . . , m, the same node splitting method is applied. In this manner, each node is processed to determine if splitting is appropriate and then each subnode created during a split is also checked for susceptibility to splitting as well. Thus, the nodes of the decision tree are split in accordance with the invention. Now, more details of the decision tree construction and node splitting method will be described.
A decision tree is built to find relations between the response variable and the predictor variables. Each split, S, of a node, T, partitions the node into m subnodes T_{1}, T_{2}, . . . , T_{m}, in hopes that the subnodes are less “noisy” than T as defined below. To quantify this idea, a realvalue function that measures the noisiness of a node T, g(T), may be defined wherein N^{T }denotes the number of cases in T, and N^{T} ^{ i }denotes the number of cases in the ith subnode T_{i}. The partition of T is exclusive, therefore, Σ_{i=1} ^{m}N^{T} ^{ i }=N^{T}. Next, the method may define Φ(S) to be the goodness of split function for a split, S, wherein:
We say that the subnodes are less noisy than their ancestor if Φ(S)>0. In Yield Mine, a node split depends only on one predictor variable. The method may search through all predictor variables, X_{1}, X_{2}, . . . , X_{n}, one by one to find the best split based on each predictor variable. Then, the best split is the one to be used to split the node. Therefore, it is sufficient to explain the method by describing how to find the best split for a single predictor variable. Depending on the types of the response variable, Y, and the predictor variable, X, as being either categorical or numerical, there are four possible scenarios. Below, details for each scenario on how the split is constructed and how to assign a proper value or a class to a terminal node is described. Now, the case when Y and X are both categorical variables is described.
Y is Categorical and X is Ategorical Categorical
Suppose that Y takes values in the set A={A_{1}, A_{2 }, . . . , A_{k}}, and X takes values in the set B={B_{1},B_{2}, . . . , B_{l}}. In this case, only binary splits are allowed. That is, if a node is split, it produces 2 subnodes, a left subnode, T_{L}, and a right subnode, T_{R}. A split rule has the form of a question: Is xΣB_{S}, where B_{S }is a subset of B. If the answer to the question is yes, then the case is put in the left subnode T_{L}. Otherwise it is put in the right subnode T_{R}. There are 2^{l }different subsets of B. Therefore, there are 2^{l }different splits.
Let N_{i} ^{T }denote the number of class i cases in node T. The function which measure measures the noisiness of the node, g(T), is defined as:
Since there are only two subnodes, the goodness of split function, Φ(S), is:
The method thus searches through all positions 2^{l }splits to find the one that minimizes Φ(S). Now, the case where Y is categorical and X is numerical will be described.
Y is Categorical and X is Numerical
Suppose that Y takes values in the set A={A_{1},A_{2}, . . . , A_{k}} and x_{1},x_{2}, . . . , x_{N} _{ T }denotes the numerical predictor variable in each case. The split in this case is also binary as above. We will again use T_{L }and T_{R }to denote the two subnodes of T. A split rule takes one of the two forms.

 1) Is x≦α?
 2) Is α<x≦β?
 where α and β take values from the set {x_{1}, x_{2}, . . . , x_{N} _{ T }}. For each case, if the answer to the split rule is true, it is put in T_{L}. Otherwise it is put in T_{R}.
Now, we define N^{T }and g(T) in the same way as in the previous scenario. Since a split in this case has one more parameter than a split in the first case above, the method may define


 wherein c is between 0 and 1 and can be set by the user. The default is 0.9. There are only finite split rules of form (1) and (2). The method thus searches through all possible splits to find the one that minimizes Φ(S). Now, the case where Y is numerical and X is categorical will be described.

Y is Numerical and X is Categorical
In this case, the split rule is the same as the first case. The only difference is the way in which the noiseness function, g(T), is defined. In particular, since Y is numerical, let y_{1}, y_{2}, . . . , y_{N} _{ T }denote the response variable for all cases in T. g(T) is then defined as the L^{P }norm of the empirical distribution function of Y in T. In particular,
Then, Φ(S) may be defined as:
As in the first case, there are only a finite number of possible splits and the method searches through all possible splits to find the one that minimizes Φ(S). Now, a fourth case where Y and X are both numerical will be described.
Y is Numerical and X is Numerical
In this case, the split rule is defined the same way as in the second case above, and g(T) is defined the same way as in the third case. Thus, the method may search through all possible splits to come up with the split, S*, which minimizes Φ(S), where:
Then, a linear regression model, as set forth below, is fit
y=a_{0}+a_{1}x+ε, (5)

 where ε is assumed to be i.i.d. Gaussian with mean 0 and variance σ^{2 }
Now, let ŷ_{i }denote the fitted value of the model for case i. Let r be the L^{P }norm of the residuals. That is,
 where ε is assumed to be i.i.d. Gaussian with mean 0 and variance σ^{2 }
If Φ(S*)<cxr , then S* is the best split. Otherwise, the linear model fits better than split form 1 and 2. In this case, the node T is split into d subnodes, T_{1}, T_{2}, . . . , T_{d}. Let {circumflex over (x)}_{1},{circumflex over (x)}_{2}, . . . , {circumflex over (x)}_{N} _{ T }denote the ordered values of x_{1}, x_{2}, . . . , x_{N} _{ T }in an increasing order. Then a case (x, y)εT_{i }if
{circumflex over (x)}_{L} _{ 1 }≦x<{circumflex over (x)}_{R} _{ i }
where
h_{1}=max{i, (N^{T }mod d)},


 where d is a user defined parameter. The default value of d is 4. Now, assigning a value or class to a terminal node will be described.

When a terminal node is reached, a value or a class, ƒ(T), is assigned to all cases in the node depending on the type of the response variable. If the type of the response variable is numerical, ƒ(T) is a real value number. Otherwise, ƒ(T) is set to be a class member of the set A={A_{1}, A_{2 }, . . . , A_{k}}. Now, the cost function may be determined if Y is categorical or numerical.
Y is Categorical
Assume Y takes values in set A={A_{1}, A_{2}, . . . , A_{k}}. T is a terminal node with N^{T }cases. Let N_{i} ^{T }be the number, Y, equal to A_{i }in T, iε{1,2, . . . , L}. If the node is pure (i.e., all the cases in the node has the same response A_{j}), then, ƒ(T)=A_{j}. Otherwise, the node is not pure. No matter which class, ƒ(T), is assigned to, there is at least one case misclassified in the node. Let u(ij) be the cost of assigning a class j case to class i. Then the total cost of assigning ƒ(T) to node T is

 where ƒ(T)=A_{j}, such that U(A_{j})=min(U(A_{i}), iε{1,2, . . . , l})
If u(ij) is constant for all i and j, then ƒ(T) is assigned to the biggest class in the node. When there is a tie for the best choice of ƒ(T) among several classes, ƒ(T) is picked arbitrarily among those classes. Now, the case where Y is numerical is described.
Y is Numerical
In this case, the cost function is the same function g(T) which measure measures the “noisiness” of the node as described above. ƒ(T) is assigned to the value which minimizes the cost. It can be easily shown that, when g(T) is the L^{2 }norm of the node, ƒ(T) equals to the mean value of the node. Now, the pruning of the decision tree will be described.
By growing an oversized tree as described above, one encounters the problem of over fitting. To deal with this problem, cross validation is used to find the right size of the model. Then, the tree can be pruned to the proper size. Ideally, one would like to split the data into two sets. One for constructing the model and one for testing. But, unless the data set is sufficiently large, using only part of the data set to build the model reduces its accuracy. Therefore, cross validation is the preferred procedure.
An nfold cross validation procedure starts with dividing the data set into n subsets, D_{1},D_{2}, . . . , D_{n}. The division is random and each subset contains as nearly as possible, the same number of cases. Let D_{i} ^{c }denote the compliment set of D_{i}. Then n tree structure models TR_{1}, TR_{2}, . . . , TR_{n }are built using the D_{1} ^{c}, D_{2} ^{c}, . . . , D_{n} ^{c}. Now we can use the cases in D_{i} ^{c }to test the validity of TR_{i }and to find out what is the right size of the tree model.
A measure of the size of a tree structure model, g(TR), the complexity of TR, is defined as follows. Let T_{T }denote the set of terminal nodes of a tree node T. Let C(t) be the cost function of node t if all nodes under t are pruned. Thus,
where T_{T} is the cardinality of T_{T}, and
where P(t) is the probability function.
Next, one can define
g(TR)=max(g(T)T is a node of TR)
Theorem: Let T_{0 }be the node, such that g(T_{0})=g(TR). Then, pruning off all subnodes of T_{0 }will not increase the complexity of the tree.
Proof
Let TR^{N }be the tree obtained by pruning off T_{0 }from TR. Every node T^{N }in tree TR^{N }comes from the node T in TR. If we can show that, for every T^{N}, g(T^{N})≦g(T), then, by definition, g(TR^{N})≦g(TR).
There are two scenarios. 1) For node T^{N}, its counter part counterpart T contains T_{0 }as one of its subnode subnodes. 2) For node T^{N}, its counter part counterpart T does not contain T_{0 }as a subnode. In the second scenario, T^{N }and T has have the same structure. Therefore, g(T^{N})=g(T). Now, let us consider the first scenario. If T^{N }has no subnode, then, g(T^{N})=0≦g(T). Otherwise, by definition,
Since, C(T^{N})=C(T), C(T)−C(T_{T})−(C(T^{N})−C(T_{T} ^{N}))=C(T_{0})−C(T_{0T}), T_{T}−1−(T_{T} ^{N}−1)=T_{0}−1, and g(T_{0})=g(TR), therefore, g(T)≦g(T_{0}). Hence, g(T^{N})≦g(T).
This theorem establishes a relationship between the size of a tree structure model and its complexity g(TR). In general, the bigger the complexity the more the number of nodes of the tree.
Cross validation can point out which complexity value v is likely to produce the most accurate tree structure. Using this v, we can prune the tree generated from the whole data set until its complexity is just below v. This pruned tree is used as the final tree structure model. Now, the model modification step will be described.
In some cases, the predictor variables can be correlated with each other. The splits of a node based on different parameters can produce similar results. In such cases, it is really up to the process engineer who uses the software to identify which parameter is the real cause of the Yield problem. To help the engineer to identify the possible candidates of parameters at any node split, all predictor variables are ranked according to their relative significance if the split were based on them. To be more precise, let X_{i }be the variable picked by the method which the split, S*, is based on.
For any j≠i let S_{j }denote the best split based on X_{j}. Then, define
Since S* is the best split 0≦q(i)≦1 . Then, when double clicking on a node, a list of all predictor variables ranked by their q values is shown as illustrated in
All the basic statistical analysis tools are available to help the user to validate the model and identify the yield problem. At each node, a right click of the mouse produces a list of tools available as shown in
After each model is built, the tree can be saved for future predictions. If a new set of parameter values is available, it can be fed into the model and generate prediction of the response value for each case. This functionality can be very handy for the user.
While the foregoing has been with reference to a particular embodiment of the invention, it will be appreciated by those skilled in the art that changes in this embodiment may be made without departing from the principles and spirit of the invention, the scope of which is defined by the appended claims.
Claims (34)
Priority Applications (2)
Application Number  Priority Date  Filing Date  Title 

US09458185 US6470229B1 (en)  19991208  19991208  Semiconductor yield management system and method 
US10972115 USRE42481E1 (en)  19991208  20041022  Semiconductor yield management system and method 
Applications Claiming Priority (1)
Application Number  Priority Date  Filing Date  Title 

US10972115 USRE42481E1 (en)  19991208  20041022  Semiconductor yield management system and method 
Related Parent Applications (1)
Application Number  Title  Priority Date  Filing Date  

US09458185 Reissue US6470229B1 (en)  19991208  19991208  Semiconductor yield management system and method 
Publications (1)
Publication Number  Publication Date 

USRE42481E1 true USRE42481E1 (en)  20110621 
Family
ID=23819718
Family Applications (2)
Application Number  Title  Priority Date  Filing Date 

US09458185 Active US6470229B1 (en)  19991208  19991208  Semiconductor yield management system and method 
US10972115 Active USRE42481E1 (en)  19991208  20041022  Semiconductor yield management system and method 
Family Applications Before (1)
Application Number  Title  Priority Date  Filing Date 

US09458185 Active US6470229B1 (en)  19991208  19991208  Semiconductor yield management system and method 
Country Status (1)
Country  Link 

US (2)  US6470229B1 (en) 
Cited By (2)
Publication number  Priority date  Publication date  Assignee  Title 

US9645097B2 (en)  20140620  20170509  KlaTencor Corporation  Inline wafer edge inspection, wafer prealignment, and wafer cleaning 
US9885671B2 (en)  20140609  20180206  KlaTencor Corporation  Miniaturized imaging apparatus for wafer edge 
Families Citing this family (15)
Publication number  Priority date  Publication date  Assignee  Title 

US7337149B2 (en) *  20001212  20080226  International Business Machines Corporation  System and methodology for calculating the cost of future semiconductor products using regression analysis of historical cost data 
US7155421B1 (en) *  20021016  20061226  Sprint Spectrum L.P.  Method and system for dynamic variation of decision tree architecture 
US6998866B1 (en) *  20040727  20060214  International Business Machines Corporation  Circuit and method for monitoring defects 
US20060095237A1 (en) *  20041028  20060504  Weidong Wang  Semiconductor yield management system and method 
US7685481B2 (en) *  20050623  20100323  Mks Instruments, Inc.  Bitmap cluster analysis of defects in integrated circuits 
US7363098B2 (en) *  20051219  20080422  Tech Semiconductor Singapore Pte Ltd  Method to identify machines causing excursion in semiconductor manufacturing 
US7533313B1 (en) *  20060309  20090512  Advanced Micro Devices, Inc.  Method and apparatus for identifying outlier data 
US8577717B2 (en) *  20060525  20131105  Taiwan Semiconductor Manufacturing Company, Ltd.  Method and system for predicting shrinkable yield for business assessment of integrated circuit design shrink 
US8615691B2 (en) *  20061013  20131224  Advantest (Singapore) Pte Ltd  Process for improving designlimited yield by localizing potential faults from production test data 
US7494893B1 (en)  20070117  20090224  Pdf Solutions, Inc.  Identifying yieldrelevant process parameters in integrated circuit device fabrication processes 
US7954018B2 (en) *  20070202  20110531  Rudolph Technologies, Inc  Analysis techniques for multilevel memory 
US20080312875A1 (en) *  20070612  20081218  Yu Guanyuan M  Monitoring and control of integrated circuit device fabrication processes 
US7539585B2 (en)  20070614  20090526  International Business Machines Corporation  System and method for rulebased data mining and problem detection for semiconductor fabrication 
US7974723B2 (en) *  20080306  20110705  Applied Materials, Inc.  Yield prediction feedback for controlling an equipment engineering system 
US9275334B2 (en) *  20120406  20160301  Applied Materials, Inc.  Increasing signal to noise ratio for creation of generalized and robust prediction models 
Citations (5)
Publication number  Priority date  Publication date  Assignee  Title 

US4754410A (en) *  19860206  19880628  Westinghouse Electric Corp.  Automated rule based process control method with feedback and apparatus therefor 
US5727128A (en) *  19960508  19980310  FisherRosemount Systems, Inc.  System and method for automatically determining a set of variables for use in creating a process model 
US5897627A (en)  19970520  19990427  Motorola, Inc.  Method of determining statistically meaningful rules 
US6098063A (en) *  19940215  20000801  R. R. Donnelley & Sons  Device and method for identifying causes of web breaks in a printing system on web manufacturing attributes 
US6336086B1 (en) *  19980813  20020101  Agere Systems Guardian Corp.  Method and system for analyzing wafer processing order 
Patent Citations (5)
Publication number  Priority date  Publication date  Assignee  Title 

US4754410A (en) *  19860206  19880628  Westinghouse Electric Corp.  Automated rule based process control method with feedback and apparatus therefor 
US6098063A (en) *  19940215  20000801  R. R. Donnelley & Sons  Device and method for identifying causes of web breaks in a printing system on web manufacturing attributes 
US5727128A (en) *  19960508  19980310  FisherRosemount Systems, Inc.  System and method for automatically determining a set of variables for use in creating a process model 
US5897627A (en)  19970520  19990427  Motorola, Inc.  Method of determining statistically meaningful rules 
US6336086B1 (en) *  19980813  20020101  Agere Systems Guardian Corp.  Method and system for analyzing wafer processing order 
NonPatent Citations (18)
Title 

"Quadrillion: QYield Product Overview," Quadrillion Corporation (last accessed at http://web.archive.org/web/19971210064219/www.quadrillion.com/qyov... Feb. 5, 2009) 2 pages. 
"Quadrillion: Training Services," Quadrillion Corporation (last accessed at http://web.archive.org/web/19971210064511/www.quadrillion.com/train.html Feb. 5, 2009) 2 pages. 
Bergendahl, et al., "Optimization of Plasma Processing, etc." IBM. J. Res. Develop., Sep. 1982, pp. 580589, vol. 26, No. 5, IBM, US. 
Data Mining and the Case for Sampling: Solving Business Problems Using SAS Enterprise Miner Software, 1998, pp. 135, Sas Institute Inc., US. 
Email from Dave Garrod at PDF Solutions, Inc. enclosing prior art for the yield analysis and data mining tool called QYield, 1 page (Sent Feb. 5, 2009). 
Famili et al., "Data Preprocessing and Intelligent Data Analysis," Intelligent Data Analysis Journal, pp. 128 (Mar. 24, 1997). 
Friedhoff, et al., "Analysis of IntraLevel Isolation Test Structure, etc." Proc. IEEE 1989 Int. Conf. Micro. Test Struc., Mar, 1989, pp. 217221,vol. 2, No. 1, Pittsburgh, PA. 
Irani et al. Expert, IEEE vol. 8, Issue 1, "Applying machine learning to semiconductor manufacturing", Feb. 1993, pp. 4147. * 
Ison et al., Semiconductor Manufacturing Conference Proceedings, 1997 IEEE Symposium on "Fault diagnosis of plasma etch equipment", San Francisco, Ca. published Oct. 68, 1997, pp. B49B52. * 
Lee et al., "Yield Analysis and Data Management Using Yield Manager(TM)," IEEE/SEMI Advanced Semiconductor Manufacturing Conference, pp. 1930 (1998). 
Lee et al., "Yield Analysis and Data Management Using Yield Manager™," IEEE/SEMI Advanced Semiconductor Manufacturing Conference, pp. 1930 (1998). 
Lee, et al., "RTSPC: A Sofware Utility for RealTime SPC, etc." IEEE Trans. Semicon. Mfg., Feb, 1995, pp. 1725, vol. 8, No. 1, US. 
Lee, F., et al., Yield Analysis and Data Management Using Yield Manager, 1998 IEEE/Semi Adv. Semi. Manuf. Conf., 1998, pp. 1930, US. 
Murthy, S., Automatic Construction of Decision Trees from Data: A MultiDisciplinary Survey, Data Mining and Knowledge Dscovery, 1998, pp. 345389, v. 2, Kluwer Aca. Pub., US. 
Perez, R., et al., Machine Learning for a Dynamic Manufacturing Environment, ACM SIGICE Bulletin, 1994, pp. 59, v. 19, US. 
Quinlan, J., Unknown Attribute Values in Induction in Segre, A. (Ed.), Proc. Sixth Intl. Machine Learning Workshop, 1989, Morgan Kaufmann, US. 
Turney, P., "Data Engineering for the Analysis of Semiconductor Manufacturing Data," Workshop on Data Engineering for Inductive Learning, pp. 110 (Apr. 3, 1995). 
Yang, YK., "EPAS: An Emitter Piloting Advisory Expert System, etc." IEEE Trans. Semicon. Mfg., May 1990, pp. 4553, vol. 3, No. 2, US. 
Cited By (2)
Publication number  Priority date  Publication date  Assignee  Title 

US9885671B2 (en)  20140609  20180206  KlaTencor Corporation  Miniaturized imaging apparatus for wafer edge 
US9645097B2 (en)  20140620  20170509  KlaTencor Corporation  Inline wafer edge inspection, wafer prealignment, and wafer cleaning 
Also Published As
Publication number  Publication date  Type 

US6470229B1 (en)  20021022  grant 
Similar Documents
Publication  Publication Date  Title 

Bazan et al.  The rough set exploration system  
Levin et al.  A stochastic model of computerhuman interaction for learning dialogue strategies  
Halkidi et al.  Quality scheme assessment in the clustering process  
US6553366B1 (en)  Analytic logical data model  
Riddle et al.  Representation design and bruteforce induction in a Boeing manufacturing domain  
He et al.  Towards an analytic framework for analysing the computation time of evolutionary algorithms  
Dash et al.  Dimensionality reduction of unsupervised data  
US6636843B2 (en)  System and method for grating profile classification  
US6611829B1 (en)  SQLbased analytic algorithm for association  
Yahia et al.  Rough neural expert systems  
US7174343B2 (en)  Indatabase clustering  
Reddy et al.  The KowledgeBased Simulation System  
Gray et al.  Nbody'problems in statistical learning  
US20050193281A1 (en)  Anomaly detection  
US20080288425A1 (en)  Methods and Apparatus for Reasoning About Information Fusion Approaches  
US20030074439A1 (en)  Systems and methods for providing offline decision support for correlation analysis  
Coenen et al.  Tree structures for mining association rules  
US20060218138A1 (en)  System and method for improving search relevance  
Last et al.  Informationtheoretic algorithm for feature selection  
US20030212702A1 (en)  Orthogonal partitioning clustering  
US20050004833A1 (en)  Method and system for integrated uncertainty analysis  
US6697802B2 (en)  Systems and methods for pairwise analysis of event data  
Hong  Use of contextual information for feature ranking and discretization  
Maqbool et al.  Hierarchical clustering for software architecture recovery  
Ma et al.  Mining partially periodic event patterns with unknown periods 
Legal Events
Date  Code  Title  Description 

AS  Assignment 
Owner name: MKS INSTRUMENTS, INC., MASSACHUSETTS Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:YIELD DYNAMICS, INC.;REEL/FRAME:021489/0065 Effective date: 20080903 

AS  Assignment 
Owner name: RUDOLPH TECHNOLOGIES, INC., NEW JERSEY Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:MKS INSTRUMENTS, INC.;REEL/FRAME:024946/0388 Effective date: 20100811 

FPAY  Fee payment 
Year of fee payment: 12 