The number of ways of matching exactly $k$ of the five cards selected from the first deck is $$\binom{5}{k}\binom{47}{5 - k}$$ since if $k$ cards match, the remaining $5 - k$ cards must be selected from among the other $47$ cards in the deck.
Therefore, the number of ways of selecting at least two matching cards is $$\binom{5}{2}\binom{47}{3} + \binom{5}{3}\binom{47}{2} + \binom{5}{4}\binom{47}{1} + \binom{5}{5}\binom{47}{0}$$ Alternatively, we can subtract the number of hands with fewer than two matching cards from the total number of hands. Hence, the number of favorable hands is $$\binom{52}{5} - \binom{5}{0}\binom{47}{5} - \binom{5}{1}\binom{47}{4}$$ In your attempt, you counted sequences in the numerator and subsets in the denominator. There is only one subset in which all five cards match. If you want to use sequences in the numerator, you also have to use them in the denominator.